Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata Regular Languages
Find the regular expression for the language accepted by the automata given below.
1
(aa* (a + b) ab)*
2
(a + b) ab (ab + bb + aa* (a + b) ab)*
3
a* ab (ab + bb + aa* (a + b) ab)*
4
a* (a + b) ab (ab + bb + aa* (a + b) ab)*