Minimizing finite automata is computationally hard (Q703578)

From MaRDI portal
Revision as of 17:10, 7 June 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
Minimizing finite automata is computationally hard
scientific article

    Statements

    title
    Minimizing finite automata is computationally hard (English)
    0 references
    author
    Andreas Malcher
    0 references
    publication date
    11 January 2005
    0 references
    zbMATH DE Number
    2126133
    0 references
    zbMATH Keywords
    Finite automata
    0 references
    Limited nondeterminism
    0 references
    Minimization
    0 references
    NP-complete
    0 references
    OpenAlex ID
    W1964127120
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q703578&oldid=34377547"
    Powered by MediaWiki