865 views

1 Answer

2 votes
2 votes

LHS

 (a (ba)* (a + bb) + b (ab)* (b + aa)) (a+b)*

Initially we have two choices,

a (ba)* (a + bb) : In this expression, at minimum either aa will accept or abb will accept.
b (ab)* (b + aa) : In this expression, at minimum either bb or baa will accept.
observe both, it says either aa or bb will accept.

When we done with choices, we will accept everything i.e (a+b)*

So it says at minimum we have to see either aa or bb, then we dont care what comes after that, we will accept everything.

RHS

(a+b)* (aa+bb) (a+b)*  : It says that we will not accept the string until we see aa or bb as substring. Which is same as what RE at LHS says.

Related questions

0 votes
0 votes
1 answer
2
M_Umair_Khan42900 asked Dec 29, 2022
780 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
1 answer
3
Abhipsa asked Jan 21, 2019
881 views
Why this is not equal?(r+s)*=r*+s*