Q. 61 Consider the NPDA 〈Q = {q0, q1, q2}, Σ = {0, 1}, Γ = {0, 1, ⊥}, δ, q0, ⊥, F = {q2}〉, where (as per usual convention) Q is the set of states, Σ is the input alphabet, Γ is stack alphabet, δ is the state transition function, q0 is the initial state, ⊥ is the initial stack symbol, and F is the set of accepting states, The state transition is as follows:
Which one of the following sequences must follow the string 101100 so that the
overall string is accepted by the automaton ?
(A) 10110
(B) 10010
(C) 01010
(D) 01001
Answer: (B)
Explanation: