Representing prefix and border tables: results on enumeration - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Mathematical Structures in Computer Science Année : 2017

Representing prefix and border tables: results on enumeration

Résumé

For some text algorithms, the real measure for the complexity analysis is not the string itself but its structure stored in its prefix table or equivalently border table. In this paper, we define the combinatorial class of prefix lists, namely a sequence of integers together with their size, and an injection ψ from the class of prefix tables to the class of prefix lists. We call a valid prefix list the image by ψ of a prefix table. In particular, we describe algorithms converting a prefix/border table to a prefix list and inverse linear algorithms from computing from a prefix list L = ψ(P) two words respectively in a minimal size alphabet and on a maximal size alphabet with P as prefix table. We then give a new upper bound on the number of prefix tables for strings of length n (on any alphabet) which is of order (1 + ϕ) n (with the golden mean) and also present a corresponding lower bound.
Fichier principal
Vignette du fichier
Representing_Prefix_Border_Tables.pdf (236.39 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01708989 , version 1 (04-06-2019)

Identifiants

Citer

Julien Clément, Laura Giambruno. Representing prefix and border tables: results on enumeration. Mathematical Structures in Computer Science, 2017, 27 (02), pp.257 - 276. ⟨10.1017/S0960129515000146⟩. ⟨hal-01708989⟩
117 Consultations
319 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More