Abstract: In [A. Frid, S. Puzynina, L.Q. Zamboni, extit{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 introduce variants of this conjecture and prove this conjecture in particular cases. Especially we introduce left and right greedy palindromic lengths. These lengths are always greater than or equals to the initial palindromic length. When the greedy left (or right) palindromic lengths of prefixes of a word are bounded then this word is ultimately periodic.
Recommendations
Cites work
- A subquadratic algorithm for minimum palindromic factorization
- Automatic Sequences
- Codes and automata.
- Conjugation of standard morphisms and a generalization of singular words
- Counting distinct palindromes in a word in linear time
- Crochemore Factorization of Sturmian and Other Infinite Words
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 3827234 (Why is no real title available?)
- scientific article; zbMATH DE number 1988973 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- On palindromic factorization of words
- On the Complexity of Finite Sequences
- ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
- On z-factorization and c-factorization of standard episturmian words
- Palindromic prefixes and episturmian words
- Some properties of the singular words of the Fibonacci word
Cited in
(13)- Palindromic length in free monoids and free groups
- Sturmian numeration systems and decompositions to palindromes
- On longest palindromic subwords of finite binary words
- Palindromic length of words with many periodic palindromes
- Prefix palindromic length of the Sierpinski word
- Palindromic length and reduction of powers
- Palindromic subsequences in finite words
- First lower bounds for palindromic length
- Greedy Conjecture for Strings of Length 4
- FINDING ALL APPROXIMATE GAPPED PALINDROMES
- Prefix palindromic length of the Thue-Morse word
- Palindromic length of infinite aperiodic words
- On highly palindromic words: the ternary case
This page was built for publication: Greedy palindromic lengths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4640335)
