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

Question

Quizplus · Accepted Answer

The automaton accepts strings that start with any number of b's, followed by an a, followed by any number of a's or b's. This is represented by the regular expression b*a(a+b)*.

Consider the Following Finite State Automaton the Language Accepted by This