On synchronizing prefix codes

DOI10.1016/S0019-9958(67)90620-1MaRDI QIDQ5539515zbMATH OpenOpenAlexFDO

Authors Marcel Paul Schützenberger

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

zbMATH Keywords

distribution of word lengthssynchronizing prefix codes

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45)

Cited in

(12)

• On some properties of very pure codes
• Some free submonoids of the free monoid of prefix codes
• Deciding Whether or Not a Synchronous Relation is Regular Prefix
• A quadratic upper bound on the size of a synchronizing word in one-cluster automata
• Shortest Synchronizing Strings for Huffman Codes
• A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata
• Left-noncounting languages
• scientific article; zbMATH DE number 1927561 (Why is no real title available?)
• Power-separating regular languages
• Optimal synchronous coding
• Finding short synchronizing words for prefix codes
• Shortest synchronizing strings for Huffman codes

This page was built for publication: On synchronizing prefix codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5539515)