Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Context Free Languages and Pushdown Automata Pushdown Automata
Consider the following NPDA = ({q0, q1, qf}, {a, b}, {1, z}, δ, q0, z, {qf})
δ(q0, λ, z) = {(qf, z)}
δ(q0, a, z) = {(q1, 11z)}
δ(q1, a, 1) = {(q1, 111)}
δ(q1, b, 1) = {(q1, λ)}
δ(q1, λ, z) = {(qf, z}
Which of the following Language L is accepted by NPDA?
1
L = {a2nbn ∶ n ≥ 0}
2
L = {anb2n ∶ n ≥ 0}
3
L = {a2nbn ∶ n > 0}
4
L = {anb2n ∶ n > 0}