Test Index

GATE CS and IT 2015 Paper

© examsnet.com

Question : 50

Total: 65

Consider the NPDA 〈Q={𝑞𝑜,𝑞1,𝑞2}, ∑={0,1}, Γ={0,1,⊥},𝛿,𝑞0,⊥, F={𝑞2}〉, 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?

10110
10010
01010
01001

Go to Question:

Prev Question

Next Question