in Theory of Computation
313 views
1 vote
1 vote
Find an npda with two states that accepts $L =$ {$a^nb^{2n} : n ≥1$}.
in Theory of Computation
313 views

1 Answer

2 votes
2 votes

for every 'a' push two a's and see b's match it off and acceptance by empty stack

 

Related questions