Finding short synchronizing words for prefix codes
From MaRDI portal
Recommendations
Cites work
- A quadratic upper bound on the size of a synchronizing word in one-cluster automata
- Almost all complete binary prefix codes have a self-synchronizing string
- Applications of approximation algorithms to cooperative games
- Approximating minimum reset sequences
- Codes and automata.
- Complexity of problems concerning reset words for cyclic and Eulerian automata
- scientific article; zbMATH DE number 7228447 (Why is no real title available?)
- scientific article; zbMATH DE number 5595151 (Why is no real title available?)
- scientific article; zbMATH DE number 3817996 (Why is no real title available?)
- On maximal codes with bounded synchronization delay
- On synchronizing prefix codes
- On the construction of statistically synchronizable codes
- On the synchronizing properties of certain prefix codes
- On two algorithmic problems about synchronizing automata (short paper)
- On two Combinatorial Problems Arising from Automata Theory
- Reset Sequences for Monotonic Automata
- Shortest synchronizing strings for Huffman codes
- Slowly synchronizing automata and digraphs
- Strong inapproximability of the shortest reset word
- Subset synchronization in monotonic automata
- Synchronizing Automata and the Černý Conjecture
Cited in
(6)- scientific article; zbMATH DE number 2051185 (Why is no real title available?)
- On Nonnegative Integer Matrices and Short Killing Words
- On finite monoids over nonnegative integer matrices and short killing words
- Extended synchronizing codewords for q-ary complete prefix codes
- An improved algorithm for finding the shortest synchronizing words
- Synchronizing strongly connected partial DFAs
This page was built for publication: Finding short synchronizing words for prefix codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5005121)
