The Gateway to Computer Science Excellence
0 votes
Find an npda with two states that accepts $L =$ {$a^nb^{2n} : n ≥1$}.
in Theory of Computation by Boss (15.4k points) | 28 views

1 Answer

+2 votes

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


by Active (1.7k points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,370 answers
105,272 users