Consider the NPDA \(\left \langle Q= \left \{ q_{0}, q_{1}, q_{2} \right…

PYQ GATE 2015

Consider the NPDA ⟨Q={q0,q1,q2},Σ={0,1},Γ={0,1,⊥},δ,q0,⊥,F={q2}⟩\left \langle Q= \left \{ q_{0}, q_{1}, q_{2} \right \},\Sigma = \left \{ 0, 1 \right \}, \Gamma = \left \{ 0, 1, \perp \right \}, \delta, q_{0}, \perp, F =\left \{ q_{2} \right \} \right \rangle, where (as per usual convention) QQ is the set of states, ∑∑ is the input alphabet, ΓΓ is the stack alphabet, 𝛿𝛿 is the state transition function, q0q_0 is the initial state, ⊥⊥ is the initial stack symbol, and FF 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?

  1. A.

    10110

  2. B.

    10010

  3. C.

    01010

  4. D.

    01001

Attempted by 121 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…