Divisible by 3 (binary). Design an DFA that recognizes the language consisting of all binary strings that represent binary numbers that are divisible by 3. For example, 1111 is accepted since 1111 is 15 in decimal, but 1110 is rejected. Hint: Use three states. Depending on the input read in so far, your DFA should be in one of three states depending on the remainder when dividing 3 into that number.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.