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.4k
- Engineering Mathematics 5.9k
- Digital Logic 2.3k
- Programming & DS 4.3k
- Algorithms 3.7k
- Theory of Computation 4.6k
- Compiler Design 1.7k
- Databases 3.4k
- CO & Architecture 2.9k
- Computer Networks 3.4k
- Non GATE 1.2k
- Others 1.3k
- Admissions 506
- Exam Queries 482
- Tier 1 Placement Questions 22
- Job Queries 64
- Projects 16

40,927 questions

47,580 answers

146,425 comments

62,311 users