Road coloring problem
Sign in to savetheorem that every aperiodic strongly-connected out-regular directed graph can be labeled to give a synchronizable deterministic finite automaton
Connections
directed graph
Entity
prime number
Entity
digital object identifier
Entity
theorem
Entity
graph theory
Entity
periodic function
Entity
Q118398
Entity
four color theorem
Entity
conjecture
Entity
maze
Entity
finite-state machine
Entity
node
Entity
graph coloring
Entity
necessity and sufficiency
Entity
degree
Entity
cycle
Entity
strongly connected component
Entity
Roy Adler
Entity
Benjamin Weiss
Entity
multiple edges
Entity