Synchronizing automata with coinciding cycles
From MaRDI portal
Publication:6088948
DOI10.1007/978-3-031-33264-7_17OpenAlexW4377081724MaRDI QIDQ6088948
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_17
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Černý conjecture for one-cluster automata with prime length cycle
- Shortest synchronizing strings for Huffman codes
- Synchronization
- Reset words for commutative and solvable automata
- Synchronizing finite automata on Eulerian digraphs.
- The complexity of synchronizing Markov decision processes
- Algebraic synchronization criterion and computing reset words
- On the interplay between Babai and Černý's conjectures
- Synchronizing groups and automata
- On Two Algorithmic Problems about Synchronizing Automata
- Robust Synchronization in Markov Decision Processes
- Reset Sequences for Monotonic Automata
- Synchronizing Automata and the Černý Conjecture
- On two Combinatorial Problems Arising from Automata Theory
- Theory Is Forever
This page was built for publication: Synchronizing automata with coinciding cycles
