On the Number of Prefix and Border Tables - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

On the Number of Prefix and Border Tables

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 border table, as border and prefix tables can be proved to be equivalent). We 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 φ=1+5√2 the golden mean) and present also a lower bound.
Fichier non déposé

Dates et versions

hal-00982224 , version 1 (23-04-2014)

Identifiants

Citer

Julien Clément, Laura Giambruno. On the Number of Prefix and Border Tables. LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Mar 2014, Montevideo, Uruguay. pp.442-453, ⟨10.1007/978-3-642-54423-1_39⟩. ⟨hal-00982224⟩
56 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More