Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata Regular Languages
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
4
L1 ∩ L2 = ϕ