A note on binary grammatical codes of trees

DOI10.1016/0304-3975(95)00093-3MaRDI QIDQ672152zbMATH OpenOpenAlexFDO

Authors Andrzej Ehrenfeucht, Paulien ten Pas, Grzegorz Rozenberg

Publication date 27 February 1997

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(95)00093-3

zbMATH Keywords

treesbinary treesbinary grammatical codesgrammatical codes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Recommendations

• Properties of grammatical codes of trees
• Grammatical codes of trees
• scientific article; zbMATH DE number 475410
• scientific article; zbMATH DE number 568780
• Binary Tree Code Words as Context-Free Languages

Cites work

• scientific article; zbMATH DE number 762057 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Grammatical codes of trees
• Properties of grammatical codes of trees

Cited in

(10)

• Codes and equations on trees
• Coding by minimal linear grammars
• HOW TO GENERATE BINARY CODES USING CONTEXT-FREE GRAMMARS
• scientific article; zbMATH DE number 762057 (Why is no real title available?)
• scientific article; zbMATH DE number 475410 (Why is no real title available?)
• Graded Computation Tree Logic with Binary Coding
• Properties of grammatical codes of trees
• Grammatical codes of trees
• Binary Tree Code Words as Context-Free Languages
• Implementation and Application of Automata

This page was built for publication: A note on binary grammatical codes of trees

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