On z-factorization and c-factorization of standard episturmian words

Abstract Ziv–Lempel and Crochemore factorization are two kinds of factorizations of words related to text processing. In this paper, we find these factorizations for standard epiesturmian words. Thus the previously known c-factorization of characteristic Sturmian words is provided as a special case. Moreover, the two factorizations are compared.

[1]  Lucian Ilie,et al.  A Simple Algorithm for Computing the Lempel Ziv Factorization , 2008, Data Compression Conference (dcc 2008).

[2]  M. Crochemore.  Recherche linéaire d'un carré dans un mot , 1983 .

[3]  M. Lothaire.  Algebraic Combinatorics on Words , 2002 .

[4]  M. Lothaire,et al.  Applied Combinatorics on Words , 2005 .

[5]  Wojciech Rytter.  Application of Lempel-Ziv factorization to the approximation of grammar-based compression , 2003, Theor. Comput. Sci..

[6]  Giuseppe Pirillo,et al.  Episturmian words and some constructions of de Luca and Rauzy , 2001, Theor. Comput. Sci..

[7]  Aldo de Luca,et al.  Sturmian Words: Structure, Combinatorics, and Their Arithmetics , 1997, Theor. Comput. Sci..

[8]  G. Rauzy.  Nombres algébriques et substitutions , 1982 .

[9]  Giuseppe Pirillo,et al.  Episturmian words and episturmian morphisms , 2002, Theor. Comput. Sci..

[10]  Giuseppe Pirillo,et al.  On a characteristic property of ARNOUX-RAUZY sequences , 2002, RAIRO Theor. Informatics Appl..

[11]  Zhi-Ying Wen,et al.  Some properties of the Tribonacci sequence , 2007, Eur. J. Comb..

[12]  Wojciech Rytter,et al.  Text Algorithms , 1994 .

[13]  Jacques Justin,et al.  Episturmian words: a survey , 2008, RAIRO Theor. Informatics Appl..

[14]  Maxime Crochemore,et al.  Algorithmique du texte , 2001 .

[15]  Abraham Lempel,et al.  On the Complexity of Finite Sequences , 1976, IEEE Trans. Inf. Theory.

[16]  Jean Berstel,et al.  Crochemore Factorization of Sturmian and Other Infinite Words , 2006, MFCS.