Name
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. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1016/S0304-3975(01)00391-7 | Theor. Comput. Sci. |
Keywords | Field | DocType |
68Q45,natural correspondence,finite maximal prefix code,Decidability result,rational language,prefix code,rational prefix code,05C05,primeness problem,finite tree | Discrete mathematics,Combinatorics,Lattice (order),Finite tree,Generalization,Prefix,Mathematics | Journal |
Volume | Issue | ISSN |
289 | 1 | Theoretical Computer Science |
Citations | PageRank | References |
3 | 0.48 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Antonio Restivo | 1 | 697 | 107.05 |
| Pedro V. Silva | 2 | 141 | 29.42 |