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

From MaRDI portal
Revision as of 15:52, 21 June 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
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

    Identifiers

     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q442134&oldid=504264"
      Powered by MediaWiki