A characterization of completely reachable automata (Q1622956)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A characterization of completely reachable automata
scientific article

    Statements

    A characterization of completely reachable automata (English)
    0 references
    22 November 2018
    0 references
    deterministic finite automaton
    0 references
    complete reachability
    0 references
    0 references
    0 references

    Identifiers