A complete solution to the complexity of synchronizing road coloring for non-binary alphabets (Q2346422)

From MaRDI portal
Revision as of 04:34, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A complete solution to the complexity of synchronizing road coloring for non-binary alphabets
scientific article

    Statements

    A complete solution to the complexity of synchronizing road coloring for non-binary alphabets (English)
    0 references
    0 references
    1 June 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    road coloring problem
    0 references
    synchronizing word
    0 references
    Černy conjecture
    0 references
    synchronizing automata
    0 references
    reset word
    0 references
    0 references