// 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?
64.3k questions
77.9k answers
243k comments
79.6k users