Road coloring problem (Q1937896)
Jump to navigation
Jump to search
theorem that every aperiodic strongly-connected out-regular directed graph can be labeled to give a synchronizable deterministic finite automaton
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Road coloring problem |
theorem that every aperiodic strongly-connected out-regular directed graph can be labeled to give a synchronizable deterministic finite automaton |
Statements
Identifiers
Sitelinks
Wikipedia(9 entries)
- enwiki Road coloring theorem
- eswiki Teorema del coloreo de carreteras
- frwiki Coloriage des routes
- hewiki בעיית צביעת המסלולים
- ptwiki Teorema da coloração do caminho
- ruwiki Теорема о раскраске дорог
- svwiki Vägfärgningsproblemet
- trwiki Yol bulma problemi
- viwiki Định lý con đường màu