Which one of the following regular expressions correctly represents the…
GATE · 2022 · CS · Computer Science & IT
Which one of the following regular expressions correctly represents the language of the finite automaton given below?
- A.
ab* bab* + ba* aba*
- B.
(ab*b)* ab* - (ba*a)* ba*
- C.
(ab*b + ba*a)* + (a* + b*)
- D.
(ba*a + ab*b)* (ab* + ba*)
Attempted by 194 students.
Sign up free to check your answer
Sign up freeLoading lesson…