Completely Reachable Automata (Q2829965)

From MaRDI portal
Revision as of 08:49, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Completely Reachable Automata
scientific article

    Statements

    title
    Completely Reachable Automata (English)
    0 references
    author
    E. A. Bondar'
    0 references
    Mikhail V. Volkov
    0 references
    publication date
    9 November 2016
    0 references
    zbMATH Keywords
    deterministic finite automaton
    0 references
    complete reachability
    0 references
    transition monoid
    0 references
    syntactic complexity
    0 references
    PSPACE-completeness
    0 references

    Identifiers

    zbMATH DE Number
    6649500
    0 references
    OpenAlex ID
    W2468044850
    0 references
    arXiv ID
    1607.00554
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2829965&oldid=33557046"
    Powered by MediaWiki