246 views
1 votes
1 votes

Doubt: Please clarify how option b is wrong.

1 Answer

0 votes
0 votes

I think option B is correct:

RE: (a+b)*(a+b+Ԑ)a = (any string)(aa+ba+a) = any string end with a = {a, aa, ba, abba, baaba, ......}

Now Option B: (Ԑ+a+b*)+a = (Ԑ+a+b*) (Ԑ+a+b*)a  ; we know (Ԑ+a+b*)* can form any string of a and b

= (Ԑ+a+b*)(any string)a = (any string)a = any string end with a.

Related questions

0 votes
0 votes
3 answers
1
0 votes
0 votes
1 answer
2
Abhishek3301 asked Feb 6
10 views
Number of states in a minimal deterministic finite automata that accepts the language L = {(a + b) a* b*} What should be the answer to this question?
0 votes
0 votes
1 answer
4
amitarp818 asked Nov 18, 2023
232 views
Given L1 = {a*baa*} and L2 = {ab*}The regular expression corresponding to language L3 = L1/L2 (right quotient) is given by