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
Wikidata facts
- Instance of
- theorem
Show 2 more facts
- solved by
- Avraham Trahtman
- maintained by WikiProject
- WikiProject Mathematics
Sources (1)
via Wikidata · CC0