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

From MaRDI portal
Revision as of 09:51, 3 August 2023 by Importer (talk | contribs) (‎Created a new 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
    road coloring problem
    0 references
    synchronizing word
    0 references
    Černy conjecture
    0 references
    synchronizing automata
    0 references
    reset word
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references