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?

Question

Accepted Answer

L1, L3 can be recognized by Deterministic Push down automata

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?

Make the most of this question