La solicitud
“A DFA over {0, 1} that accepts binary numbers divisible by 3. States q0, q1 and q2 track the remainder; q0 is the start state and the accepting state.”
Entonces pruebaChange it to divisible by 5Name the states by their remainder
Qué hay en este dibujo
Lee las decisiones que hay detrás.
01
State represent remainder modulo 3 (0, 1, 2).
02Transitions
on 0, state = (state*2) % 3; on 1, state = (state*2+1) % 3.
03
Accepting state is q0 (remainder 0), indicated by a note.
When modeling finite state machines that accept regular languages based on numeric modulo properties.