2 votes 2 votes Consider the following Regular expression: (a+b)*abb(a+b)* (a+b)*a(a+b)*bb(a+b)* (a+b)*ab(a+b)*b(a+b)* (a+b)*abb(a+b)*a Which of the above regular expression are equivalent ? Theory of Computation theory-of-computation regular-expression + – Raj Kumar 7 asked Jan 25, 2019 Raj Kumar 7 330 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes 1 and 2 kallu singh answered Jan 25, 2019 kallu singh comment Share Follow See all 3 Comments See all 3 3 Comments reply Raj Kumar 7 commented Jan 25, 2019 reply Follow Share Why not 3 ? 0 votes 0 votes kallu singh commented Jan 25, 2019 reply Follow Share option 3 we can generate abab string but option 1 and 2 not 1 votes 1 votes Raj Kumar 7 commented Jan 25, 2019 reply Follow Share Is there any efficient way to check the equivalency of language ? plz explain ............. 0 votes 0 votes Please log in or register to add a comment.