## Question: Find mod function i.e. one binary number divided by 3 and find the remainder or modulus.

Like 11 mod 3 = 0    101 mod 3 = 2

Moore Machine for mod 3

State 2

${\mathbf{q}}_{\mathbf{1}}$ 100 mod 3 = 1

${\mathbf{q}}_{\mathbf{2}}$ 101 mod 3 = 2

Example:

Let number 10110 = 22 mod 3 =1

We can easily convert the Moore machine to DFA because it has some similarities. So, we can convert it by just remove the output with the state.