Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Context Free Languages and Pushdown Automata Context Free Grammars
Consider L = L1 ∩ L2
Where L1 = {0m1m20n1n |m, n >= 0}
L2 = {0m1n2k | m, n, k ≥ 0}
Then, the language L is
1
Recursively enumerable but not context free
2
Regular
3
Context free but not regular
4
Not recursive