Consider the transition diagram of a PDA given below with input alphabet \(Σ =…
PYQ GATE 2016
Consider the transition diagram of a PDA given below with input alphabet and stack alphabet . is the initial stack symbol. Let denote the language accepted by the PDA.

Which one of the following is TRUE?
- A.
and is not accepted by any finite automata - B.
and is not accepted by any deterministic PDA - C.
is not accepted by any Turing machine that halts on every input - D.
and is deterministic context-free
Attempted by 213 students.
Sign up free to check your answer
Sign up freeLoading lesson…

