Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata Regular Languages
Consider the finite automata given below :
The language b accepted by this automata is given by the regular expression :
1
b* a b * a b * a b *
2
(a + b)*
3
b*a (a + b)*
4
b* ab* ab*