Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata Regular Languages
Consider the following regular expression:
\(\left( i \right){r_1} = \left( {0 + 10} \right)*\left( {1 + \epsilon} \right)\)
\(\left( {ii} \right){r_2} = \left( {0*\left( {10} \right)*} \right)*\left( {1 + \epsilon} \right) + 0*\left( {1 + \epsilon} \right) + \left( {10} \right)*\left( {1 + \epsilon} \right)\)
Which of the following is TRUE?1
L(r1) ⊂ L(r2)
2
L(r2) ⊂ L(r1)
3
L(r1) = L(r2)
4
L(r1) and L(r2) are uncomparable