How can I draw FA over {0, 1} which represent binaries of Integers only divisible by 3 and all leading 0’s are permissible?
Thanks in advance
Hint:Let the binary number 'x' have k ones in it. Then .
But modulo 3 this reads:
.
However we want this to be 0 mod 3. Then can you figure out the constraint on s?
Finite Automaton. Its a representation for an state based algorithm. Electronic engineers would simply call it a state machine thoughOriginally Posted by Alvyda