## Interesting DFA

Deterministic Finite Automaition Definition: $(Q, s, A, \delta)$ $Q$: A set of all the possible state. $s \in Q$ : starting state. The state to start the machine. $A \subseteq Q$: The set of states we accept. Return “good” when we end there. $\delta$: A function $Q \times \Sigma \rightarrow Q$. The set of all transition functions. There is an interesting DFA design question. The question is as follows: Given a bit-string (a string that contains only 0s and 1s), design a DFA that accepts the string if and only if the number represented by the string is divisible by 5....