GATE | CS 2022 | Question 12

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*)

Answer: (D)
Explanation:

(ab*b+ba*a)(ab* + ba* ) is equivalent to (ba*a+ ab*b)* (ab* + ba*). Hence option D is the correct answer. 

Quiz of this Question
Please comment below if you find anything wrong in the above post