Can you explain in English what the DFA is doing as well. I gather that the size of the string is mod3=0.

Thanks!

Consider the n-bit binary representation of a natural number the binary representation of x is (xn-1Xn-2 . . . XiZo)2 x,2 where each bit ai is a binary digit, either zero or one. For example, (00000101)2 is the 8-bit binary representation of the number 5, since 0-27+0.26+0-25+0-24+0-23+1-22+0.21+1-20- 4 +1 - 5. This is the format normally employed by digital computers to store nonnegative integers Consider the language For example, since 5 3 = 8, 5 (000101)2, 3-(000011)2, and 8 (001000)2, then 110 010 100 001 000 000 E L (the string is spaced every three digits for readability's sake only) Define a DFA that acceptsL