-
A minimum state deterministic finite automata accepting the language L = {W | W ∈ {0, 1}*, number of 0's and 1's in W are divisible by 3 and 5, respectively as.
-
- 15 states
- 11 states
- 10 states
- 9 states
- 15 states
Correct Option: A
It is given that the 0's and 1's are divisible by 3 and 5 and we know that 3 and 5 do not have any factor other than themselves or 1 i.e., these cannot be further breakdown.
Therefore, number of states = 3 × 5 = 15
The schematic representation is as follows:
