On the lattice of prefix codes

Authors:
Antonio Restivo;Pedro V. Silva
Affiliations:
Dipartimento di Matematica ed Applicazioni, Università degli Studi di 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:
Theoretical Computer Science
Year:
2002

Citing 4
Cited 2

The meet operation in the lattice of codes

Theoretical Computer Science
Periodicities on trees

Theoretical Computer Science
Automata, Languages, and Machines

Automata, Languages, and Machines
Theory of Codes

Theory of Codes

Periodicity vectors for labelled trees

Discrete Applied Mathematics
Preface

Theoretical Computer Science - The art of theory

Quantified Score

Hi-index	5.23

Visualization

Abstract

The natural correspondence between prefix codes and trees is explored, generalizing the results obtained in Giammarresi et al. (Theoret. Comput. Sci. 205 (1998) 1459) for the lattice of finite trees under division and the lattice of finite maximal prefix codes. Joins and meets of prefix codes are studied in this light in connection with such concepts as finiteness, maximality and varieties of rational languages. Decidability results are obtained for several problems involving rational prefix codes, including the solution to the primeness problem.