Lec 06 : Finite Automata to check divisibility by 3
Design a Finite automata over {0,1} that accepts strings in binary that are divisible by 3 (when interpreted as binary number)
Design a Finite automata over {0,1} that accepts strings in binary that are divisible by 3 (when interpreted as binary number)