Binary completely reachable automata (Q6109017)

From MaRDI portal
Revision as of 10:27, 2 August 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7719354
Language Label Description Also known as
English
Binary completely reachable automata
scientific article; zbMATH DE number 7719354

    Statements

    title
    Binary completely reachable automata (English)
    0 references
    author
    Q6072404
    0 references
    Mikhail V. Volkov
    0 references
    publication date
    26 July 2023
    0 references
    zbMATH Keywords
    deterministic finite automaton
    0 references
    transition monoid
    0 references
    complete reachability
    0 references
    strongly connected digraph
    0 references
    Cayley digraph
    0 references

    Identifiers

    arXiv ID
    2205.09404
    0 references
    Mathematics Subject Classification ID
    68Qxx
    0 references
    68Rxx
    0 references
    68Wxx
    0 references
    zbMATH DE Number
    7719354
    0 references
    OpenAlex ID
    W4312294040
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6109017&oldid=37546651"
    Powered by MediaWiki