Consider the NPDA $(Q = \{q_0, q_1, q_2\}, \Sigma = \{0, 1\}, \Gamma = \{0, 1, \bot\}, \delta, q_0, \bot, F = \{q_2\})$, where (as per usual convention) $Q$ is the set of states, $\Sigma$ is the input alphabet, $\Gamma$ is the stack alphabet, $\delta$ is the state transition function, $q_0$ is the initial state, $\bot$ 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?

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 the 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?

Topic-wise GATE CS PYQs with verified steps