Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Context Free Languages and Pushdown Automata Pushdown Automata
The language of the following PDA would be:
δ(q0, a, z0) = (q0, aaaz0)
δ(q0, a, a) = (q0, aaaa)
δ(q0, b, a) = (q1, λ)
δ(q1, b, a) = (q1, λ)
δ(q1, ∈, z0) = (qf, z0), where qf is a final state.
1
{anbn|n > 0}
2
{anb2n|n > 0}
3
{anb3n|n > 0}
4
{anb4n|n > 0}