Skip to Main content Skip to Navigation

On the fixed points of the iterated pseudopalindromic closure operator

Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00580665
Contributor : Damien Jamet <>
Submitted on : Monday, March 28, 2011 - 10:20:54 PM
Last modification on : Friday, March 27, 2020 - 3:18:03 PM
Document(s) archivé(s) le : Thursday, November 8, 2012 - 12:50:37 PM

File

modif2.pdf
Files produced by the author(s)

Identifiers

Citation

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

Share

Metrics

Record views

507

Files downloads

431