Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata Regular Languages
Consider the following regular expressions:
(a) r = a(b + a)*
(b) s = a(a + b)+
(c) t = aa*b
Choose the correct answer from the options given below based on the relation between the languages generated by the regular expressions above:
1
L(r) ⊆ L(s) ⊆ L(t)
2
L(r) ⊇ L(s) ⊇ L(t)
3
L(r) ⊇ L(t) ⊇ L(s)
4
L(s) ⊇ L(t) ⊇ L(r)