10 mod 16 = 10. Congruent to 10 means those numbers, which when divided by 16 give a remainder 10 ( i.e. 10 mod 16)
Consider the following numbers congruent to 10 mod 16 and their binary equivalents
10 |
1010 |
26 |
11010 |
42 |
101010 |
58 |
111010 |
90 |
1011010 |
1898 |
11101101010 |
All these numbers end with 010...keeping this mind, construct the DFA.
Hence, the number of states will be 5.