0 votes 0 votes Show that the language $L =$ {$ww^R : w ∈$ {$a,b$}$^*$} is not inherently ambiguous. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation inherently-ambiguous grammar + – Naveen Kumar 3 asked Apr 14, 2019 Naveen Kumar 3 152 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.