Problem:
Question- Design a DFSA to accept the following language:
{x is an element of {0,1,2}^* | x is divisible by 3}
Ex: some that could be accepted are 12, 111, 2112, 21,
some that wouldnt be accepted are 1,11,121, 212, 1111
I thought i had it but the 3rd states are throwing me off. sucha s with the number 111
Please explain the designing of DFSA.