Q43

MCQ2 marks, −0.67

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

Which one of the following is TRUE?

(A)

$L =\{a^nb^n\mid n \geq0 \}$ and is not accepted by any finite automata

(B)

$L =\{a^n\mid n \geq0 \} \cup \{a^nb^n \mid n \geq 0\}$ and is not accepted by any deterministic PDA

(C)

$L$ is not accepted by any Turing machine that halts on every input

(D)

$L =\{a^n\mid n \geq0 \} \cup \{a^nb^n \mid n \geq 0\}$ and is deterministic context-free

Loading…