![Mcqmate logo](https://mcqmate.com/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/images/logos/logo-white.png)
McqMate
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)* |
View all MCQs in
Theory of Computation and Compiler DesignNo comments yet