An extension to trees of the Sardinas and Patterson algorithm

DOI10.1016/0020-0190(82)90030-8zbMath0512.94015OpenAlexW2068816425MaRDI QIDQ1050318

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

algorithmtreescodesfree submonoid

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
• Infinite trees in normal form and recursive equations having a unique solution
• Initial Algebra Semantics and Continuous Algebras
• Heterogeneous algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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