Please format your questions better . As it stands, the options are very ambiguous.

Or if possible, post a picture.

Or if possible, post a picture.

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

0 votes

The regular expression

(aa)* + a (aa)*+ aaaaa*a*

is the same as

A) (a+aa+aaa)*

B) aaa* + aaaaa* + aaaaaa*

C) (aaa)*a****(a*+aa*)a+

D) none of the above

(aa)* + a (aa)*+ aaaaa*a*

is the same as

A) (a+aa+aaa)*

B) aaa* + aaaaa* + aaaaaa*

C) (aaa)*a****(a*+aa*)a+

D) none of the above

0

Please format your questions better . As it stands, the options are very ambiguous.

Or if possible, post a picture.

Or if possible, post a picture.

0

I can't understand option C.

But from the expression given in the question you can see that it can generate even length strings because of (aa)* = {epsilon,aa,aaaa....}

you can generate odd length strings as well because of a(aa)*= {a,aaa,aaaaa....}

So combining both you can generate any length string on a. So the expression reduces to a*. The third term does not have any significance anymore. Option A should be the answer.

But from the expression given in the question you can see that it can generate even length strings because of (aa)* = {epsilon,aa,aaaa....}

you can generate odd length strings as well because of a(aa)*= {a,aaa,aaaaa....}

So combining both you can generate any length string on a. So the expression reduces to a*. The third term does not have any significance anymore. Option A should be the answer.

+1

Option A is the answer........this will generate any length of string that is a*.

In option C , the property of regular languange can be applied that is

(a*)* = a*.

So options are valid here and it can written as

(aaa)*a*(a*+aa*)a*a

OR

(aaa)*a*(a*+aa*)aa*

And both these regular expression are equivalent and the language generated by this expression is atleast one a 's should be there.

In option C , the property of regular languange can be applied that is

(a*)* = a*.

So options are valid here and it can written as

(aaa)*a*(a*+aa*)a*a

OR

(aaa)*a*(a*+aa*)aa*

And both these regular expression are equivalent and the language generated by this expression is atleast one a 's should be there.

- All categories
- General Aptitude 1.5k
- Engineering Mathematics 7.1k
- Digital Logic 2.7k
- Programming & DS 4.9k
- Algorithms 4.2k
- Theory of Computation 5.3k
- Compiler Design 2.1k
- Databases 4k
- CO & Architecture 3.5k
- Computer Networks 4k
- Non GATE 1.4k
- Others 1.5k
- Admissions 559
- Exam Queries 553
- Tier 1 Placement Questions 23
- Job Queries 69
- Projects 18

47,913 questions

52,293 answers

182,250 comments

67,738 users