Complexity of problems concerning reset words for cyclic and Eulerian automata (Q442134): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 05:07, 30 January 2024

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