A note on binary grammatical codes of trees

DOI10.1016/0304-3975(95)00093-3zbMATH Open0872.68085OpenAlexW2000755915MaRDI QIDQ672152FDOQ672152

Grzegorz Rozenberg, Andrzej Ehrenfeucht, Paulien ten Pas

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

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

zbMATH Keywords

treesbinary treesbinary grammatical codesgrammatical codes

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Grammatical codes of trees
• Properties of grammatical codes of trees

Cited In (9)

• Title not available (Why is that?)
• Grammatical codes of trees
• Properties of grammatical codes of trees
• Graded Computation Tree Logic with Binary Coding
• Codes and equations on trees
• HOW TO GENERATE BINARY CODES USING CONTEXT-FREE GRAMMARS
• Binary Tree Code Words as Context-Free Languages
• Implementation and Application of Automata
• Title not available (Why is that?)

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)