0 votes 0 votes Show that the complement of the language $L=$ {$ww^R:w∈$ {$a,b$}$^*$} 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 209 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes S→ ASA | B A→ a | b B→ aCb | bCa C→ aCa | bCb | ϵ JAINchiNMay answered Oct 11, 2020 JAINchiNMay comment Share Follow See all 0 reply Please log in or register to add a comment.