Completely distinguishable automata and the set of synchronizing words
From MaRDI portal
Publication:6067333
DOI10.1007/978-3-031-33264-7_11OpenAlexW4377081478MaRDI QIDQ6067333
Publication date: 16 November 2023
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-33264-7_11
synchronizing automataset of synchronizing wordscompletely reachable automatacompletely distingusihable automata
Related Items (2)
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lengths of words in transformation semigroups generated by digraphs
- The mathematical writings of Évariste Galois
- Orienting polygonal parts without sensors
- The road coloring problem
- Synchronization
- Quelques problèmes de connexite dans les graphes orientes
- Space-bounded reducibility among combinatorial problems
- The state complexities of some basic operations on regular languages
- A characterization of completely reachable automata
- On the computational complexity of problems related to distinguishability sets
- Černý's conjecture and the road colouring problem
- Sync-maximal permutation groups equal primitive permutation groups
- Cerny's conjecture for automata with simple idempotents
- 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
- Constrained synchronization and commutativity
- Between primitive and 2-transitive: synchronization and its friends
- Completely Reachable Automata
- Strong Inapproximability of the Shortest Reset Word
- Reset Sequences for Monotonic Automata
- Synchronizing Automata and the Černý Conjecture
- The Complexity of Finding Reset Words in Finite Automata
- Semicomputable points in Euclidean spaces
- Reset Complexity of Ideal Languages Over a Binary Alphabet
- Estimation of the length of reset words for automata with simple idempotents
- Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees
- Binary completely reachable automata
This page was built for publication: Completely distinguishable automata and the set of synchronizing words
