Binary Tree Code Words as Context-Free Languages

DOI10.1093/COMJNL/41.6.422MaRDI QIDQ4246268zbMATH OpenOpenAlexFDO

Authors Erkki Mäkinen

Publication date 31 May 1999

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/23d789637adf5af360d41fc26d78d1b40da740b3

zbMATH Keywords

binary tree coding systembinary tree languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• A note on binary grammatical codes of trees
• scientific article; zbMATH DE number 762057
• A tree-height hierarchy of context-free languages
• scientific article; zbMATH DE number 475410
• The coding of binary trees
• Context-free grammars on trees
• On context-free trees
• Grammar-Oriented Enumeration of Binary Trees
• scientific article; zbMATH DE number 54244
• A context-free language for binary multinomial processing tree models

Cited in

(6)

• How to generate binary codes using context-free grammars
• A context-free language for binary multinomial processing tree models
• HOW TO GENERATE BINARY CODES USING CONTEXT-FREE GRAMMARS
• Implementation and Application of Automata
• scientific article; zbMATH DE number 762057 (Why is no real title available?)
• A note on binary grammatical codes of trees

This page was built for publication: Binary Tree Code Words as Context-Free Languages

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