Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Context Free Languages and Pushdown Automata Context Free Languages
Let
L1 = {0n 1n 0m | n >= 1, m >= 1}
L2 = {0n 1m 0m | n >= 1, m >= 1}
L3 = {0n 1n 0n | n >= 1}
Which of the following are correct statements?
A. L3 = L1 ∩ L2
B. L1 and L2 are context free languages but L3 is not a context free language
C. L1 and L2 are not context free languages but L3 is a context free language
D. L1 is a subset of L3
Choose the correct answer from the options given below :
1
A and B only
2
A and C only
3
A and D only
4
A only