Exercise 21:

Minimum DFA for {w{0,1}value2(w)3˙}\{ w \in \{0,1\}^* \mid \mathtt{value}_2(w)\in\dot{3} \}
Describe the minimum DFA that recognizes the words over {0,1}\{0,1\} such that interpreted in binary represent a natural number multiple of 33 (in particular, the empty word represents 00, which is multiple of 33).
Authors: Guillem Godoy / Documentation:
To be able to submit you need to either log in, register, or become a guest.