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

Let L1 and L2 be languages over ∑ = {a, b} represented by the regular expressions (a* + b)* and (a + b)* respectively.

Which of the following is true with respect to the two languages?

1.L1 ⊂ L2
2.L2 ⊂ L1
3.L1 = L2 ✓ Correct
4.L1 ∩ L2 = ϕ
📄 All “Theory of Computation” questions across papers
🏷 Change Tag for this Question