-
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 = { an bn |n ≥ 0 } and is not accepted by any finite automata
- L = { an | n ≥ 0 } ∪ { an bn | n ≥ 0 } and is not accepted by any deterministic PDA
- L is not accepted by any Turing machine that halts on every input
- L = { an |n ≥ 0 } ∩ { an bn | n ≥ 0 } and is deterministic context-free
- L = { an bn |n ≥ 0 } and is not accepted by any finite automata
Correct Option: D
Initial state is also the final state. So an is also accepted.
