Road coloring problem
theorem that every aperiodic strongly-connected out-regular directed graph can be labeled to give a synchronizable deterministic finite automaton
theorem that every aperiodic strongly-connected out-regular directed graph can be labeled to give a synchronizable deterministic finite automaton