Skip to content
Related Articles

Related Articles

GATE | GATE CS Mock 2018 | Question 52
  • Last Updated : 10 Jan, 2018

Consider the following context free languages:

L1 = {0^i 1^j 2^k | i+j = k}
L2 = {0^i 1^j 2^k | i = j or j = k}
L3 = {0^i 1^j  | i = 2j+1}

Which of the following option is true?

(A) L1, L2 and L3 can be recognized by Deterministic Push down automata
(B) L1, L2 can be recognized by Deterministic Push down automata
(C) L1, L3 can be recognized by Deterministic Push down automata
(D) None of the above


Answer: (C)

Explanation: L1, L3 can be recognized by Deterministic Push down automata.


Quiz of this Question

sudo-gate-course

My Personal Notes arrow_drop_up
Recommended Articles
Page :