A characterization of completely reachable automata
From MaRDI portal
Publication:1622956
DOI10.1007/978-3-319-98654-8_12OpenAlexW2963754233MaRDI QIDQ1622956
E. A. Bondar', Mikhail V. Volkov
Publication date: 22 November 2018
Full work available at URL: https://arxiv.org/abs/1805.02879
Related Items (8)
Completely distinguishable automata and the set of synchronizing words ⋮ Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees ⋮ Binary completely reachable automata ⋮ Unnamed Item ⋮ Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words ⋮ State complexity of the set of synchronizing words for circular automata and automata over binary alphabets ⋮ Sync-maximal permutation groups equal primitive permutation groups ⋮ Reset complexity and completely reachable automata with simple idempotents
This page was built for publication: A characterization of completely reachable automata
