Completely Reachable Automata (Q2829965): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1025070
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Mikhail V. Volkov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2468044850 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1607.00554 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of topological Markov shifts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitive digraphs with large exponents and slowly synchronizing automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5250634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2831601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Analysis: Transformation Monoids of Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: SYNTACTIC COMPLEXITY OF ℛ- AND 𝒥-TRIVIAL REGULAR LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper Bound on Syntactic Complexity of Suffix-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical finite transformation semigroups. An introduction. / rank
 
Normal rank
Property / cites work
 
Property / cites work: RANK PROBLEMS FOR COMPOSITE TRANSFORMATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The road coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing Automata and the Černý Conjecture / rank
 
Normal rank

Latest revision as of 21:20, 12 July 2024

scientific article
Language Label Description Also known as
English
Completely Reachable Automata
scientific article

    Statements

    Completely Reachable Automata (English)
    0 references
    0 references
    0 references
    9 November 2016
    0 references
    deterministic finite automaton
    0 references
    complete reachability
    0 references
    transition monoid
    0 references
    syntactic complexity
    0 references
    PSPACE-completeness
    0 references

    Identifiers