McqMate
Q. |
How many states are present in the minimum state finite automaton that recognizes the language represented by the regular expression (0+1)(0+1)…..N times? |
A. | n+1 |
B. | n+2 |
C. | n |
D. | 2n |
Answer» B. n+2 |
View all MCQs in
Theory of ComputationNo comments yet