Q1937896

From Wikidata
Jump to: navigation, search

Road coloring problem(Q1937896)

theorem that every aperiodic strongly-connected out-regular directed graph can be labeled to give a synchronizable deterministic finite automaton
    No aliases defined.
[edit]
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

    /m/0h7r36
    1 reference
    0 references