# Road coloring problem

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

**Wikidata**: [Q1937896](https://www.wikidata.org/wiki/Q1937896)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Road_coloring_theorem)  
**Source**: https://4ort.xyz/entity/road-coloring-problem


## References

1. Freebase Data Dumps. 2013