0 votes 0 votes Show that the following language is context-free. $L=$ {$uvwv^R:u,v,w∈$ {$a,b$}$^+,|u|=|w|=2$}. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation context-free-grammar context-free-language + – Naveen Kumar 3 asked Apr 14, 2019 Naveen Kumar 3 328 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes S→ AAB A→a | b B→ aBb | bBb | AA JAINchiNMay answered Oct 11, 2020 JAINchiNMay comment Share Follow See all 0 reply Please log in or register to add a comment.