📚 Question Bank Q54 — Theory of Computation
Tags
Theory of Computation
Q54. Marks: +2.0 UGC NET Paper 2: Computer Science 2020

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 ✓ Correct
4.Not recursive
📄 All “Theory of Computation” questions across papers
🏷 Change Tag for this Question