On the fixed points of the iterated pseudopalindromic closure operator

Damien Jamet (1) , Geneviève Paquin (2) , Gwenaël Richomme (3) , Laurent Vuillon (4)

1 ADAGIO - Applying Discrete Algorithms to Genomics and Imagery
2 Département d'informatique [Montréal]
3 LaRIA - Laboratoire de Recherche en Informatique d'Amiens
4 LAMA - Laboratoire de Mathématiques

First introduced in the study of the Sturmian words by de Luca in 1997, iterated palindromic closure was generalized to pseudopalindromes by de Luca and De Luca in 2006. This operator allows one to construct words with infinitely many pseudopalindromic prefixes, called pseudostandard words. We provide here several combinatorial properties of the fixed points under iterated pseudopalindromic closure.

Domaines: Mathématique discrète [cs.DM]

Damien Jamet, Geneviève Paquin, Gwenaël Richomme, Laurent Vuillon. On the fixed points of the iterated pseudopalindromic closure operator. Theoretical Computer Science, 2011, 412 (27), pp.2974-2987. ⟨10.1016/j.tcs.2010.03.018⟩. ⟨hal-00580665⟩