1 votes 1 votes For the language $L =$ {$a^nb^{2n} : n ≥ 0$}, show that $L^*$ 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 280 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes L$^{*}$ sakharam answered Nov 6, 2019 sakharam comment Share Follow See 1 comment See all 1 1 comment reply Veenit commented Nov 14, 2019 reply Follow Share This machine isn't deterministic as for q1 state, there are two choices for z (empty stack symbol). 0 votes 0 votes Please log in or register to add a comment.