Q.

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
Answer» C. b*a(a+b)*
928
0
Do you find this helpful?
1

View all MCQs in

Theory of Computation

Discussion

No comments yet

Related MCQs