GATE Computer Science (CS) 2016 Shift 1 Solved Paper

© examsiri.com

Question : 53 of 65

Marks: +1, -0

Consider the transition diagram of a PDA given below with input alphabet ∑ = {a, b} and stack alphabet Γ = {X, Z}. Z is the initial stack symbol. Let L denote the language accepted by the PDA.

Which one of the following is TRUE?

L = { aⁿbⁿ|n ≥ 0} and is not accepted by any finite automata
L = { aⁿ| n ≥ 0} ∪ { aⁿbⁿ| n ≥ 0} and is not accepted by any deterministic PDA
L is not accepted by any Turing machine that halts on every input
L = { aⁿ|n ≥ 0} ∪ {aⁿbⁿ|n ≥ 0} and is deterministic context-free

Go to Question:

Prev Question

Next Question