Which one of the following regular expressions correctly represents the…

PYQ GATE 2022

Which one of the following regular expressions correctly represents the language of the finite automaton given below?

  1. A.

    ab* bab* + ba* aba*

  2. B.

    (ab*b)* ab* - (ba*a)* ba*

  3. C.

    (ab*b + ba*a)* + (a* + b*)

  4. D.

    (ba*a + ab*b)* (ab* + ba*)

Attempted by 231 students.

Sign up free to check your answer

Sign up free

Explore the full course: Theory Of Computation

Loading lesson…