-
The following finite state machine accepts all those binary strings in which the number of 1's and 0's are respectively.
-
- divisible by 3 and 2
- odd and even
- even and odd
- divisible by 2 and 3
- divisible by 3 and 2
Correct Option: A
The given finite state machine accepts any string W ∈ (0, 1)* in which the number of 1's is multiple of 3 and the number of 0's is multiple of 2.
