← GATE CSE 2007

Q74

MCQ2 marks, −0.5

Consider the following Finite State Automaton:

The language accepted by this automaton is given by the regular expression

(A)

$b^*ab^*ab^*ab^*$

(B)

$(a + b)^*$

(C)

$b^*a(a+b)^*$

(D)

$b^*ab^*ab^*$

Sign in to save attempts.

Loading…