engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Context Free Languages and Pushdown Automata Pushdown Automata
Consider the transition diagram of a PDA given below with input alphabet ∑ = {a, b} and stack alphabet Γ = {X, Z}. Z is the initial stack symbol. Let L denote the language accepted by the PDA.
What will be the A and B transition respectively in order for PDA to accept the language { an|n ≥ 0} ∪ {anbn|n ≥ 0}?
1
A = (ϵ, ϵ / ϵ ), B = ( b, X / ϵ )
2
A = ( b, X / ϵ ), B = ( ϵ , Z / Z)
3
A = ( b, X / ϵ ), B = ( b, X / ϵ)
4
A = ( b, X / ϵ ), B = ( ϵ , X / ϵ )