Binary completely reachable automata
From MaRDI portal
Publication:6109017
DOI10.1007/978-3-031-20624-5_21arXiv2205.09404OpenAlexW4312294040MaRDI QIDQ6109017
Unnamed Author, Mikhail V. Volkov
Publication date: 26 July 2023
Published in: LATIN 2022: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.09404
Cayley digraphdeterministic finite automatonstrongly connected digraphtransition monoidcomplete reachability
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Related Items (3)
Completely distinguishable automata and the set of synchronizing words ⋮ Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees ⋮ Binary and circular automata having maximal state complexity for the set of synchronizing words
Cites Work
- Unnamed Item
- The Černý conjecture and 1-contracting automata
- Surpassing the information theoretic bound with fusion trees
- A characterization of completely reachable automata
- Extremal synchronizing circular automata
- Completely Reachable Automata
- Estimation of the length of reset words for automata with simple idempotents
This page was built for publication: Binary completely reachable automata