Completely Reachable Automata (Q2829965)

From MaRDI portal
Revision as of 15:40, 17 August 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
Completely Reachable Automata
scientific article

    Statements

    title
    Completely Reachable Automata (English)
    0 references
    author
    E. A. Bondar'
    0 references
    Q376116
    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
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2829965&oldid=3156539"
      Powered by MediaWiki