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.
    [edit]

    Statements

    0 references
    [edit]
    Language Code Linked page
    English enwiki
    עברית hewiki
    русский ruwiki
    svenska svwiki
    Türkçe trwiki
    Tiếng Việt viwiki
    [edit]
    [edit]
    [edit]
    [edit]
    [edit]