Some results concerning careful synchronization of partial automata and subset synchronization of DFA's
From MaRDI portal
Publication:2164741
DOI10.1007/978-3-031-07469-1_8OpenAlexW4293193257MaRDI QIDQ2164741
Publication date: 16 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-07469-1_8
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Černý conjecture and 1-contracting automata
- Shortest synchronizing strings for Huffman codes
- A lower bound for the length of the shortest carefully synchronizing words
- Synchronization
- Improved upper bounds on synchronizing nondeterministic automata
- Reset words for commutative and solvable automata
- Synchronizing finite automata on Eulerian digraphs.
- Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata
- The complexity of synchronizing Markov decision processes
- Preimage problems for deterministic finite automata
- Algebraic synchronization criterion and computing reset words
- Subset Synchronization and Careful Synchronization of Binary Finite 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
- Asymptotic estimate of the length of a diagnostic word for a finite automaton
- Careful Synchronization of Partial Automata with Restricted Alphabets
- Lower Bounds for Synchronizing Word Lengths in Partial Automata
- Theory Is Forever
