Question

The following finite state machine accepts all those binary strings in which the number of 1's and 0's are respectively

• A. even and odd
• B. odd and even
• C. divisible by 2 & 3
• D. divisible by 3 & 2

Answer 1

The correct option is D divisible by 3 & 2

The given finite state machine accepts any string w $ϵ$ $(0,1{)}^{\ast }$ in which the number of 1s is multiple of 3 and the number of 0s is multiple of 2.