Prefix codes, trees, and automata

DOI10.1016/0020-0255(75)90012-2zbMath0305.94055OpenAlexW2006063247MaRDI QIDQ1217779

Jean-Louis Lassez

Publication date: 1975

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://docs.lib.purdue.edu/cstech/58

Mathematics Subject Classification ID

Trees (05C05) Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Prefix codes and isomorphic automata
• Efficient error-limiting variable-length codes
• Codes conjugués
• On the structure of systematic prefix codes
• On the synchronizing properties of certain prefix codes

This page was built for publication: Prefix codes, trees, and automata