GATE | IT | 2008 | TOC | Regular Expression | Question 31

Last Updated :
Discuss
Comments

Consider the following languages.



L1 = {ai bj ck | i = j, k ≥ 1}

L1 = {ai bj | j = 2i, i ≥ 0}

Which of the following is true?

L1 is not a CFL but L2 is

L1 ∩ L2 = ∅ and L1 is non-regular

L1 ∪ L2 is not a CFL but L2 is

There is a 4-state PDA that accepts L1, but there is no DPDA that accepts L2

This question is part of this quiz :

Regular languages and finite automata,Context free languages and Push-down automata,Gate IT 2008
Tags:
Theory of Computation
GATE
Share your thoughts in the comments