Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata
Consider the following languages:
\({L_1} = \{ {a^{{{̇ z}^z}}}|̇ Z\;is\;an\;integer\} \)
L2 = {azż | Ż ≥ 0}
L3 = {ωω | ω ϵ {a, b}* }
Which of the languages is (are) regular ?
Choose the correct answer from the options given below:
1
L1 and L2 only
2
L1 and L3 only
3
L1 only
4
L2 only