2009/04/24 by Didier Jamet, Jamet, D., Geneviève Paquin +5
Computer Science · Engineering · Mathematics · #Advanced Numerical Analysis Techniques #Combinatorics (math.CO) #Contact Mechanics and Variational Inequalities #FOS: Mathematics #Mathematical functions and polynomials
paper · pdf · doi:10.48550/arxiv.0904.3828
openalex publication_date 2009/04/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
First introduced in the study of the Sturmian words, the iterated palindromic closure was recently generalized to pseudopalindromes. This operator allows one to construct words with an infinity of pseudopalindromic prefixes, called pseudostandard words. We provide here several combinatorial properties of the fixed points under the iterated pseudopalindromic closure.