recognize strings of 1's and 0's which are multiples of 3 Construct a minimized Deterministic Finite Automaton that recognizes strings of 1's and 0's that are multiples of 3.

This was one of the questions asked in my cycle test.

What would be a correct interpretation to this question?


Strings having a number of 0's and 1's that are multiple of 3, e.g.000111, 011010
Strings of 0's and 1's which in binary notation is a multiple of 3, e.g. 11, 110
Or any other radix notation, taking 0's and 1's, and checking if they are multiples of 3
If the question intends anything other than your option&nbsp;2 (binary representations of natural numbers that are divisible by&nbsp;3), then it is a badly written question.

If the qeustion meant strings in which the number of 0s and the number of 1s are both divisible by&nbsp;3, it would have said that. It would be bizarre to have numbers whose digits are all 0s and 1s and intend some base other than binary without mentioning that.