0 votes 0 votes Show that $L =$ {$a^nb^{2n} : n ≥ 0$} is a deterministic context-free language. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation context-free-language + – Naveen Kumar 3 asked Jun 23, 2019 Naveen Kumar 3 202 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.