362 views

1 Answer

Best answer
2 votes
2 votes
In L.H.S.

$\left ( a+b \right )^{*}ab\left ( a+b \right )^{*}$

It will generate all string which have 'ab' as substring.

So to prove it correct you have to accept string which does not have 'ab' as substring such as 'aa','ba','bb'.

All these are generated by b$^{*}$a$^{*}$.

Thus they are equal.
selected by

Related questions

2 votes
2 votes
2 answers
2
Ash666 asked Sep 12, 2021
1,254 views
Let r1=(0+1)*, r2=0*1+10*+0*+1*. What is the length of the smallest string that is present in language corresponds to regular expression r1 and not present in language co...