0 votes 0 votes Show that the language $L=$ {$w_1cw_2:w_1,w_2∈$ {$a,b$}$^+,w_1\neq w_2^R$}, with $Σ =$ {$a,b,c$},is context-free. 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 248 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes S→ASA | S1 S1→ bS2a | aS2b| aS2| bS2 S2→AS2A | c A→ b | a JAINchiNMay answered Oct 11, 2020 JAINchiNMay comment Share Follow See all 0 reply Please log in or register to add a comment.