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

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)  ✓ Correct
3.L(r) ⊇ L(t) ⊇ L(s)
4.L(s) ⊇ L(t) ⊇ L(r)
📄 All “Theory of Computation” questions across papers
🏷 Change Tag for this Question