Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words
From MaRDI portal
Publication:2232291
DOI10.1007/978-3-030-68195-1_24OpenAlexW3135896290MaRDI QIDQ2232291
Publication date: 4 October 2021
Full work available at URL: https://arxiv.org/abs/2007.09104
primitive permutation groupssynchronizationfinite automatastate complexitycompletely reachable automata
Related Items
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 ⋮ New characterizations of primitive permutation groups with applications to synchronizing automata ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Černý conjecture and 1-contracting automata
- Primitive digraphs with large exponents and slowly synchronizing automata
- The mathematical writings of Évariste Galois
- Primitive permutation groups and their section-regular partitions.
- A characterization of completely reachable automata
- Reset complexity of ideal languages over a binary alphabet
- Between primitive and 2-transitive: synchronization and its friends
- Synchronizing groups and automata
- Transitivity of finite permutation groups on unordered sets
- \(k\)-homogeneous groups
- A brief history of the classification of the finite simple groups
- Completely Reachable Automata
- Synchronizing Automata and the Černý Conjecture
- Slowly Synchronizing Automata and Digraphs
- Reset Complexity of Ideal Languages Over a Binary Alphabet
- Estimation of the length of reset words for automata with simple idempotents
