Complexity of problems concerning reset words for cyclic and Eulerian automata (Q442134)

From MaRDI portal
Revision as of 13:42, 5 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
Complexity of problems concerning reset words for cyclic and Eulerian automata
scientific article

    Statements

    Complexity of problems concerning reset words for cyclic and Eulerian automata (English)
    0 references
    0 references
    9 August 2012
    0 references
    0 references
    synchronization
    0 references
    automata
    0 references
    reset words
    0 references
    computational complexity
    0 references
    0 references