0 votes
0 votes


//  pda accept the string in 2 -ways.either by final state or empty stack.

my doubt is in the diagram at state q1 is for every 'a' it pops one 'b'.when no of 'b' are equall it accept or not.

and what is the language accepted by above PDA?

in Theory of Computation
607 views

Please log in or register to answer this question.

Related questions