Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Context Free Languages and Pushdown Automata Pushdown Automata
What language is accepted by the pushdown automation
M = ({q0, q1, q2}, {a, b}, {a, b, z}, δ, q0, z, {q2})
with δ(q0, a, a) = {(q0, aa)}; δ(q0, b, a) = {(q0, ba)}
δ(q0, a, b) = {(q0, ab)}; δ(q0, b, b) = {(q0, bb)}
δ(q0, a, z) = {(q0, az)}; δ(q0, b, z) = {(q0, bz)}
δ(q0, λ, b) = {(q1, b)}; δ(q0, λ, a) = {(q1, a)}
δ(q1, a, a) = {(q1, λ)}; δ(q1, b, b) = {(q1, λ)}
δ(q1, λ, z) = {(q2, z)}?
1
L = {w | na(w) = nb(w), w Є {a, b}+}}
2
L = {w | na(w) <= nb(w), w Є {a, b}+}}
3
L = {w | nb(w) <= na(w), w Є {a, b}+}}
4
L = {wwR | w Є {a, b}+}