engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Context Free Languages and Pushdown Automata Pushdown Automata
Consider the pushdown automaton below which runs over the input alphabet {a,b}. It has Z0 as the bottom of stack marker. The PDA accepts by reaching the final state. The language accepted by the PDA is:
1
{anbn | n >=1}
2
{w | na(w) = nb(w)}
3
{ambn | m=n}
4
a*b*