Abstract | ||
---|---|---|
The concept of a periodicity vector is introduced in the context of labelled trees, and some new periodicity theorems are obtained. These results constitute generalizations of the classical periodicity theorem of Fine and Wilf for words. The concept of a tree congruence is also generalized and the isomorphism between the lattice of tree congruences and the lattice of unlabelled trees (prefix codes) is established. |
Year | DOI | Venue |
---|---|---|
2003 | 10.1016/S0166-218X(02)00248-2 | Discrete Applied Mathematics |
Keywords | Field | DocType |
68q45,classical periodicity theorem,labelled tree,05c05,tree congruence,periodicity vector,prefix code,periodicity,unlabelled tree,new periodicity theorem,formal languages,formal language | Graph theory,Discrete mathematics,Combinatorics,Tree (graph theory),Generalization,Monoid,Isomorphism,Congruence relation,Congruence (geometry),Prefix code,Mathematics | Journal |
Volume | Issue | ISSN |
126 | 2-3 | Discrete Applied Mathematics |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Antonio Restivo | 1 | 697 | 107.05 |
Pedro V. Silva | 2 | 141 | 29.42 |