This site uses cookies only for the purpose of identifying user sessions.
This is required to properly register actions.
Minimum DFA for $\{ w \in \{0,1\}^* \mid \mathtt{value}_2(w)\in\dot{3} \}$
Describe the minimum DFA that recognizes the words over $\{0,1\}$ such that
interpreted in binary represent a natural number multiple of $3$
(in particular, the empty word represents $0$, which is multiple of $3$).
Authors: Guillem Godoy
/
Documentation: