in Theory of Computation
344 views
2 votes
2 votes

Consider the following Regular expression:

  1. (a+b)*abb(a+b)*
  2. (a+b)*a(a+b)*bb(a+b)*
  3. (a+b)*ab(a+b)*b(a+b)*
  4. (a+b)*abb(a+b)*a

 

Which of the above regular expression are equivalent ?

in Theory of Computation
344 views

1 Answer

0 votes
0 votes
1 and 2

3 Comments

Why not 3 ?
0
0
option 3 we can generate abab string but option 1 and 2 not
1
1
Is there any efficient way to check the equivalency of language ?

plz explain  .............
0
0