Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata Regular Languages
let r = a(a + b)*, s = aa*b and t = a*b be three regular expressions. Consider the following:
(i) L(s) ⊆ L(r) and L(s) ⊆ L(t)
(ii). L(r) ⊆ L(s) and L(s) ⊆ L(t)1
Only (i) is correct
2
Both (i) and (ii) are correct
3
Only (ii) is correct
4
Neither (i) nor (ii) is correct