Periodicity vectors for labelled trees

Authors:
Antonio Restivo;Pedro V. Silva
Affiliations:
Dipartimento di Matematica ed Applicazioni, University of Palermo, Via Archirafi 34, 90123 Palermo, Italy;Centro de Matemática, Faculdade de Ciências, Universidade do Porto, R. Campo Alegre 687, 4169-007 Porto, Portugal
Venue:
Discrete Applied Mathematics
Year:
2003

Citing 5
Cited 1

Periodicities on trees

Theoretical Computer Science
Automata, Languages, and Machines

Automata, Languages, and Machines
Theory of Codes

Theory of Codes
On the lattice of prefix codes

Theoretical Computer Science
Generalizations of the Periodicity Theorem of Fine and Wilf

CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming

Preface

Theoretical Computer Science - The art of theory

Quantified Score

Hi-index	0.04

Visualization

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.