Question

For a DFA accepting binary numbers whose decimal equivalent is divisible by 4, what are all the possible remainders?

(a) 0

(b) 0,2

(c) 0,2,4

(d) 0,1,2,3

I had been asked this question in unit test.

I need to ask this question from The Language of DFA in chapter Finite Automata of Automata Theory

Answer 1

The correct answer is (d) 0,1,2,3

Easy explanation: All the decimal numbers on division would lead to only 4 remainders i.e. 0,1,2,3 (Property of Decimal division).