4,105 views
3 votes
3 votes
1.One of the following Regular Expressions is not the same as others. Which one?

 

A. (a* + b*a*)*            B. (a*b* + b*a*)* (a*b*)*

 

C. ((ab)* + a*)*           D. (a + b)* a*b*a*b*

3 Answers

2 votes
2 votes
It should be C. It does not generate strings having 2 consecutive b's including b alone. Rest are equivalent to (a+b)*
0 votes
0 votes
Ans is c.

take any string starting with b. Options a,b,d satisfied this but Option c is not able to satisfy .

Related questions

0 votes
0 votes
1 answer
1
M_Umair_Khan42900 asked Dec 29, 2022
782 views
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b].s(a) p(pp)*( A + p)q + q and p*q(b) A +0(0+1)* + (0+1)* 00(0+1)...
0 votes
0 votes
0 answers
2
sripo asked Oct 10, 2018
667 views
For $\sum$={a,b} Re given is b*ab*(aa)*b* this is non minimized dfa but when the dfa is minimized we get RE as b*a(a+b)*. How to show that are they equivalent or is it ju...
0 votes
0 votes
1 answer
3
goluabhinan asked Sep 11, 2018
814 views
Consider the regular expression R = a*b* + b*a*. The number of equivalence classes of Σ* to represent a language which is equivalent to R is ____________.
0 votes
0 votes
2 answers
4