Left greedy palindromic length
Résumé
In [A. Frid, S. Puzynina, L.Q. Zamboni, On palindromic factorization of words, Adv. in Appl. Math. 50 (2013), 737-748], it was conjectured that any infinite word whose palindromic lengths of factors are bounded is ultimately periodic. We prove this conjecture in a particular case where the palindromic length is replaced with the left greedy palindromic length.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...