Shortest Synchronizing Strings for Huffman Codes
From MaRDI portal
Publication:3599120
DOI10.1007/978-3-540-85238-4_9zbMath1173.94411OpenAlexW1590168214MaRDI QIDQ3599120
Publication date: 3 February 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85238-4_9
Related Items (2)
Algebraic synchronization criterion and computing reset words ⋮ A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata
Cites Work
- Unnamed Item
- Synchronizing automata with a letter of deficiency 2
- Synchronizing codewords of \(q\)-ary Huffman codes
- Synchronizing finite automata on Eulerian digraphs.
- Synchronizing generalized monotonic automata
- Self-synchronizing Huffman codes (Corresp.)
- Reset Sequences for Monotonic Automata
- Almost all complete binary prefix codes have a self-synchronizing string
- On two Combinatorial Problems Arising from Automata Theory
- On the characterization of statistically synchronizable variable-length codes
- On the construction of statistically synchronizable codes
- On synchronizing prefix codes
- Construction of minimum-redundance codes with an optimum synchronizing property
- An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture
This page was built for publication: Shortest Synchronizing Strings for Huffman Codes
