Question: Construct a finite-state machine that reads binary strings and gives an output of 1 if the number of 1s read so far is divisible by
Construct a finite-state machine that reads binary strings and gives an output of 1 if the number of 1s read so far is divisible by 3 and on output of 0 otherwise.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
