Skip to Main content Skip to Navigation
Conference papers

Left greedy palindromic length

Abstract : 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.
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01232103
Contributor : Gwenaël Richomme <>
Submitted on : Sunday, November 22, 2015 - 10:19:20 PM
Last modification on : Tuesday, May 12, 2020 - 1:46:05 PM
Long-term archiving on: : Friday, April 28, 2017 - 4:28:11 PM

File

left_greedy_palindromic_length...
Files produced by the author(s)

Identifiers

  • HAL Id : lirmm-01232103, version 1

Citation

Michelangelo Bucci, Gwenaël Richomme. Left greedy palindromic length. Journées Montoises d'Informatique Théorique, Sep 2014, Nancy, France. ⟨lirmm-01232103⟩

Share

Metrics

Record views

182

Files downloads

366