![Mcqmate logo](https://mcqmate.com/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/images/logos/logo-white.png)
McqMate
Q. |
A minimum state deterministic finite automation accepting the language L = {W |W € {0,1}* , number of 0's and 1's in W are divisible by 3 and 5 respectively has |
A. | 15 States |
B. | 11 states |
C. | 10 states |
D. | 9 states |
Answer» A. 15 States |
View all MCQs in
Theory of Computation and Compiler DesignNo comments yet