in Theory of Computation
147 views
0 votes
0 votes
Show that the language $L =$ {$ww^R : w ∈$ {$a,b$}$^*$} is not inherently ambiguous.
in Theory of Computation
147 views

Please log in or register to answer this question.

Related questions