Find a regular expression for a grammar which generates a language which states :

Question

TuteeHUB · Accepted Answer

NA

TuteeHUB · Answer

L contains a set of strings starting wth an a and ending with a b, with something in the middle.

TuteeHUB · Answer

a(a*Ub*)b

TuteeHUB · Answer

a*(aUb)b*

TuteeHUB · Answer

a(a*b*)b

TuteeHUB · Answer

None of the mentioned

1.	Find a regular expression for a grammar which generates a language which states :
A.	L contains a set of strings starting wth an a and ending with a b, with something in the middle.
B.	a(aUb)b
C.	a(aUb)b
D.	a(ab)b
E.	None of the mentioned
Answer» B.

Discussion