in Theory of Computation
197 views
1 vote
1 vote
For the language $L =$ {$a^nb^{2n} : n ≥ 0$}, show that $L^*$ is a deterministic context-free language.
in Theory of Computation
197 views

1 Answer

0 votes
0 votes

L$^{*}$

1 comment

This machine isn't deterministic as for q1 state, there are two choices for z (empty stack symbol).
0
0

Related questions