in Theory of Computation
150 views
0 votes
0 votes
Show that $L =$ {$a^nb^{2n} : n ≥ 0$} is a deterministic context-free language.
in Theory of Computation
150 views

Please log in or register to answer this question.

Related questions