Teaching HPSC Lecturer (Technical) Mock Test 2024 Theory of Computation Regular Languages and Finite Automata Regular Languages
Which one of the following regular expressions correctly represents the language of the finite automaton given below?
1
ab*bab*+ba*aba*
2
(ab*b)*ab* + (ba*a)*ba*
3
(ab*b + ba*a)*(a* + b*)
4
(ba*a + ab*b)*(ab* + ba*)
5
Question Not Attempted