Consider the following Finite State Automaton. The language accepted by this automaton is given by the regular expression
A. A
B. B
C. C
D. D
Answer:C
Consider the following Finite State Automaton. The language accepted by this automaton is given by the regular expression
A. A B. B C. C D. D