in Theory of Computation
313 views
0 votes
0 votes
Show that the following language is context-free.

   $L=$ {$uvwv^R:u,v,w∈$ {$a,b$}$^+,|u|=|w|=2$}.
in Theory of Computation
313 views

1 Answer

0 votes
0 votes

S→ AAB 
A→a  |  b

B→ aBb  |  bBb | AA
 

Related questions