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

From MaRDI portal
Revision as of 01:16, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Complexity of problems concerning reset words for cyclic and Eulerian automata
scientific article

    Statements

    title
    Complexity of problems concerning reset words for cyclic and Eulerian automata (English)
    0 references
    author
    Pavel Martyugin
    0 references
    publication date
    9 August 2012
    0 references
    zbMATH DE Number
    6064523
    0 references
    zbMATH Keywords
    synchronization
    0 references
    automata
    0 references
    reset words
    0 references
    computational complexity
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q442134&oldid=25578410"
    Powered by MediaWiki