If $L$ is a regular language over $\Sigma = \{a,b\} $, which one of the following languages is NOT regular?
$ww^R$ is well known CFL - the PDA can non-deterministically determine the middle position of the string and start popping (this is not DCFL though). Reverse, Suffix, Prefix, Concatenation of Regular(s) is Regular. Answer is (B).
I think it is already explained in the answer…
Reverse, Concatenation operations on Regular(s) is Regular.
option A is a concatenation of regular and its reverse, therefore it is a regular language
Draw Finite Automata for L then Interchange states intial to final and final to initial then concatenate L with L^R using Epsilon
I am not able to differentiate between option A and Option B. I got the example for option B. Can someone provide example for option A?
if L= {ab}
then in option A → it becomes ab.ba= abba
In option B also abba possible.
For both the cases stack is needed.
64.3k questions
77.9k answers
244k comments
80.0k users