Consider the following languages,

• L₁ = {aⁱb^jc^k | i + j = k}
• L₂ = {aⁱb^j | i = 2j + 1}
• L₃ = {aⁱbcⁱ| i ≥ 0}

Which of the following option is correct?
(A) Only L₁ and L₂ can be recognized by deterministice push down automata.
(B) Only L₁ and L₃ can be recognized by deterministice push down automata.
(C) Only L₂ and L₃ can be recognized by deterministice push down automata.
(D) All L₁, L₁ and L₂ can be recognized by deterministice push down automata.


Answer: (D)

Explanation: All given languages are deterministic-context-free languages which can be recognized by deterministic push down automata because of explicit middle elements.

Option (D) is correct.

Quiz of this Question