Q2

MCQ1 mark, −0.33

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

(A)

$ab^{\ast}bab^{\ast} + ba^{\ast}aba^{\ast}$

(B)

$(ab^{\ast}b)^{\ast}ab^{\ast} + (ba^{\ast}a)^{\ast} ba^{\ast}$

(C)

$(ab^{\ast}b + ba^{\ast}a)^{\ast} (a^{\ast} + b^{\ast})$

(D)

$(ba^{\ast}a + ab^{\ast}b)^{\ast} (ab^{\ast} + ba^{\ast})$

Loading…