Consider the NPDA (Q= q0,q1,q2 , Σ= 0,1 , Γ= 0,1,⊥ , δ, q0, ⊥, F= q2 ), where Q is the state set, Σ the input alphabet, Γ the stack alphabet, δ the transit

Question

Consider the NPDA (Q={q0,q1,q2}, Σ={0,1}, Γ={0,1,⊥}, δ, q0, ⊥, F={q2}), where Q is the state set, Σ the input alphabet, Γ the stack alphabet, δ the transition function, q0 the initial state, ⊥ the initial stack symbol, and F the accepting-state set.
Transitions (Z denotes a stack symbol):
q0 loop: 1,Z→1Z and 0,Z→0Z.
q0→q1: 0/1/ε,Z→Z.
q1 loop: 0,1Z→Z and 1,0Z→Z.
q1→q2: ε,⊥→ε.
Which one of the following sequences must follow the string 101100 so that the overall string is accepted by the automaton?

Accepted Answer

B. 10010

Related Theory of Computation PYQs

Turn practice into measurable progress