The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
57 views
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
asked in Theory of Computation by (17 points) | 57 views
0
Please format your questions better . As it stands, the options are very ambiguous.

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.
+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.
0
c will be the answer check for a every option

eplison will be generated in A hence false

a can not be genrated by B

1 Answer

0 votes

Ans is :Option (A)

answered by (217 points)
0
thanks for your explanation it' s correct option

Related questions

+1 vote
1 answer
5


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

44,071 questions
49,594 answers
162,953 comments
65,786 users