Paper Info
Title
Grammatical codes of trees
Abstract
The problem of coding (chain free) trees by words where the length of the word coding a tree t equals the number of leaves of t is investigated. The notion of an insertive strict code is introduced and investigated—these are codes of a grammatical nature. It is shown that there are exactly 120 insertive strict codes. A characterization of these codes (and their various subclasses) is given in grammatical terms.
Year
DOI
Venue
1991
10.1016/0166-218X(91)90095-E
Discrete Applied Mathematics
Keywords
Field
DocType
grammatical code
Graph theory,Discrete mathematics,Coding (social sciences),Grammar,Mathematics,Mathematical logic
Journal
Volume
Issue
ISSN
32
2
Discrete Applied Mathematics
Citations 
PageRank 
References 
3
0.62
0
Authors
2
Name
Order
Citations
PageRank
A. Ehrenfeucht11823497.83
G. Rozenberg239645.34