GATE | GATE CS 2010 | Question 40

Last Updated :
Discuss
Comments

Consider the languages - 
L1 = {0i1j | i != j}. 
L2 = {0i1j | i = j}. 
L3 = {0i1j | i = 2j+1}. 
L4 = {0i1j | i != 2j}.

Only L2 is context free

Only L2 and L3 are context free

Only L1 and L2 are context free

All are context free

This question is part of this quiz :

GATE CS 2010,Context free languages and Push-down automata
Tags:
GATE
Theory of Computation
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy