Gate2007_74

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* 

Discuss

0Comment