Q1937896

From Wikidata
Jump to: navigation, search

Road coloring problem (Q1937896)[edit]

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

No aliases defined. [add]

Statements