The Complexity of Finding Reset Words in Finite Automata (Q3586114)

From MaRDI portal
Revision as of 20:28, 15 March 2024 by Daniel (talk | contribs) (‎Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710525515655)
scientific article
Language Label Description Also known as
English
The Complexity of Finding Reset Words in Finite Automata
scientific article

    Statements

    title
    The Complexity of Finding Reset Words in Finite Automata (English)
    0 references
    author
    J. Olschewski
    0 references
    Michael Ummels
    0 references
    publication date
    3 September 2010
    0 references
    zbMATH DE Number
    5779320
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3586114&oldid=31075496"
    Powered by MediaWiki