On synchronizing prefix codes
From MaRDI portal
Publication:5539515
DOI10.1016/S0019-9958(67)90620-1zbMath0157.25905OpenAlexW1993691274MaRDI QIDQ5539515
No author found.
Publication date: 1967
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(67)90620-1
Related Items (10)
Shortest synchronizing strings for Huffman codes ⋮ Optimal synchronous coding ⋮ On some properties of very pure codes ⋮ Unnamed Item ⋮ Left-noncounting languages ⋮ Some free submonoids of the free monoid of prefix codes ⋮ Shortest Synchronizing Strings for Huffman Codes ⋮ A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA ⋮ A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata ⋮ Power-separating regular languages
This page was built for publication: On synchronizing prefix codes
