Which one of the following regular expressions is NOT equivalent to the regular expression $(a + b + c)^*$?
If r is a regular expression denoting a language L(r) over some alphabet Σ, and we have Σ ⊆ L(r) then L((r)*) = Σ*.
Source: http://www.fbeedle.com/formallanguage/ch07.pdf
Correct Answer: C.
Hi @Praveen Saini ji,
What do you want to show via intermediate expansion. If you can explain then it will be great help.
@Praveen Saini @abhishekmehta4u
Can we say $a^{*}b^{*}$ = $a^{*}+b^{*}$?
We try to genrate string a,b,c . For each expression .
GATE Overflow