Synchronization of strongly connected partial DFAs and prefix codes
From MaRDI portal
Cites work
- A counter example to a conjecture concerning synchronizing words in finite automata
- A Method for the Construction of Minimum-Redundancy Codes
- Algebraic synchronization criterion and computing reset words
- An improvement to a recent upper bound for synchronizing words of finite automata
- Directable nondeterministic automata
- Exact synchronization for finite-state sources
- Finding short synchronizing words for prefix codes
- scientific article; zbMATH DE number 7228447 (Why is no real title available?)
- scientific article; zbMATH DE number 3757713 (Why is no real title available?)
- scientific article; zbMATH DE number 3460178 (Why is no real title available?)
- scientific article; zbMATH DE number 7152087 (Why is no real title available?)
- scientific article; zbMATH DE number 3222112 (Why is no real title available?)
- Mortality and synchronization of unambiguous finite automata
- On finite monoids over nonnegative integer matrices and short killing words
- On maximal codes with bounded synchronization delay
- On two algorithmic problems about synchronizing automata (short paper)
- On two Combinatorial Problems Arising from Automata Theory
- On unique factorizations of primitive words.
- Polynomial complete problems in automata theory
- Reset Sequences for Monotonic Automata
- Reset words for commutative and solvable automata
- Robust Synchronization in Markov Decision Processes
- Shortest synchronizing strings for Huffman codes
- Subset synchronization and careful synchronization of binary finite automata
- Synchronization of finite automata
- Synchronizing Automata and the Černý Conjecture
- Synchronizing automata over nested words
- Synchronizing Data Words for Register Automata
- Synchronizing finite automata on Eulerian digraphs.
- Synchronizing strategies under partial observability
- Synchronizing strongly connected partial DFAs
- Synchronizing words for weighted and timed automata
- The complexity of synchronizing Markov decision processes
- Unambiguous automata
- Unique Subwords in Nonperiodic Words
- Words of minimum rank in deterministic finite automata
This page was built for publication: Synchronization of strongly connected partial DFAs and prefix codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7364492)
