An extension to trees of the Sardinas and Patterson algorithm

DOI10.1016/0020-0190(82)90030-8MaRDI QIDQ1050318zbMATH OpenOpenAlexFDO

Authors Paul Franchi-Zannettacci

Publication date 1982

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(82)90030-8

zbMATH Keywords

algorithmcodesfree submonoidtrees

Mathematics Subject Classification ID

Trees (05C05) Artificial intelligence (68T99) Prefix, length-variable, comma-free codes (94A45)

Cites work

• Attribute grammars and recursive program schemes. I. II
• Heterogeneous algebras
• scientific article; zbMATH DE number 4006192 (Why is no real title available?)
• scientific article; zbMATH DE number 3583696 (Why is no real title available?)
• scientific article; zbMATH DE number 3597890 (Why is no real title available?)
• scientific article; zbMATH DE number 3607504 (Why is no real title available?)
• scientific article; zbMATH DE number 3332047 (Why is no real title available?)
• Infinite trees in normal form and recursive equations having a unique solution
• Initial Algebra Semantics and Continuous Algebras

Cited in

(1)

• An extended result of Kleitman and Saks concerning binary trees

This page was built for publication: An extension to trees of the Sardinas and Patterson algorithm

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