On palindromic factorization of words
From MaRDI portal
Publication:394756
DOI10.1016/j.aam.2013.01.002zbMath1285.68133OpenAlexW2092297493MaRDI QIDQ394756
Svetlana Puzynina, Luca Q. Zamboni, Anna E. Frid
Publication date: 27 January 2014
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aam.2013.01.002
Related Items (28)
Fully bordered words ⋮ Prefix palindromic length of the Thue-Morse word ⋮ Diverse Palindromic Factorization Is NP-complete ⋮ Palindromic factorization of rich words ⋮ Remarks on Privileged Words ⋮ On Morphisms Preserving Palindromic Richness ⋮ Subword Complexity and Decomposition of the Set of Factors ⋮ Prefix palindromic length of the Sierpinski word ⋮ Palindromic decompositions with gaps and errors ⋮ Palindromic length and reduction of powers ⋮ EERTREE: an efficient data structure for processing palindromes in strings ⋮ A characterization of subshifts with bounded powers ⋮ Words with many palindrome pair factors ⋮ Palindromic length of words and morphisms in class \(\mathcal{P}\) ⋮ A subquadratic algorithm for minimum palindromic factorization ⋮ Smallest and Largest Block Palindrome Factorizations ⋮ Palindromic Decompositions with Gaps and Errors ⋮ On highly palindromic words: the \(n\)-ary case ⋮ On prefix palindromic length of automatic words ⋮ Diverse Palindromic Factorization is NP-Complete ⋮ Greedy Palindromic Lengths ⋮ Sturmian numeration systems and decompositions to palindromes ⋮ Longest arithmetic progressions of palindromes ⋮ Unnamed Item ⋮ A metric characterisation of repulsive tilings ⋮ On highly palindromic words: the ternary case ⋮ Local symmetry dynamics in one-dimensional aperiodic lattices: a numerical study ⋮ Privileged factors in the Thue-Morse word -- a comparison of privileged words and palindromes
Cites Work
- Unnamed Item
- Introducing privileged words: privileged complexity of Sturmian words
- A characterization of subshifts with bounded powers
- On the maximal sum of exponents of runs in a string
- The ``runs conjecture
- Palindromic richness
- Periodicity and the golden ratio
- Palindrome complexity.
- On the palindromic decomposition of binary words
- Episturmian words and some constructions of de Luca and Rauzy
This page was built for publication: On palindromic factorization of words