Grammatical codes of trees

DOI10.1016/0166-218X(91)90095-EMaRDI QIDQ1179181zbMATH OpenOpenAlexFDO

Authors Andrzej Ehrenfeucht, Grzegorz Rozenberg

Publication date 26 June 1992

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218x(91)90095-e

zbMATH Keywords

codesgrammarstrees

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Review text

The authors study the problem of coding a tree by words in an efficient way. The coding words have the length equal to the number of leaves of the trees. In particular, the insertive strict codes are characterized.

Recommendations

• Properties of grammatical codes of trees
• scientific article; zbMATH DE number 762057
• A note on binary grammatical codes of trees
• Trees and semantics
• Syntactic structures as multi-dimensional trees
• Languages of Nested Trees
• Semantics of trees
• scientific article; zbMATH DE number 475413

Cites work

• scientific article; zbMATH DE number 3523149 (Why is no real title available?)
• Quasi-Monotonic Sequences: Theory, Algorithms and Applications
• The Sequence Equivalence Problem is Decidable for 0S Systems

Cited in

(12)

• Properties of grammatical codes of trees
• Code and parse trees for lossless source encoding
• Coding by minimal linear grammars
• A note on trees and codes
• Multigram codes (Corresp.)
• Semantics of trees
• Generating binary trees in A-order from codewords defined on a four-letter alphabet
• On the reconstruction of a Motzkin Tree from its code
• Polypodic codes
• scientific article; zbMATH DE number 762057 (Why is no real title available?)
• Codes and equations on trees
• A note on binary grammatical codes of trees

This page was built for publication: Grammatical codes of trees

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