On palindromic factorization of words
From MaRDI portal
Recommendations
- Palindromic factorization of rich words
- On the palindromic decomposition of binary words
- On highly palindromic words
- Words with many palindrome pair factors
- A connection between palindromic and factor complexity using return words
- On the numbers of palindromes
- Recent advances of palindromic factorization
- Total palindrome complexity of finite words
- Palindromic subsequences in finite words
Cites work
- A characterization of subshifts with bounded powers
- Episturmian words and some constructions of de Luca and Rauzy
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- Introducing privileged words: privileged complexity of Sturmian words
- On the maximal sum of exponents of runs in a string
- On the palindromic decomposition of binary words
- Palindrome complexity.
- Palindromic richness
- Periodicity and the golden ratio
- The ``runs conjecture
Cited in
(41)- On highly palindromic words
- On words with the zero palindromic defect
- Sturmian numeration systems and decompositions to palindromes
- Longest arithmetic progressions of palindromes
- Palindromic length of words with many periodic palindromes
- Palindromic factorization of rich words
- Prefix palindromic length of the Sierpinski word
- Palindromic length and reduction of powers
- On highly palindromic words: the \(n\)-ary case
- On prefix palindromic length of automatic words
- First lower bounds for palindromic length
- 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
- Fully bordered words
- A connection between palindromic and factor complexity using return words
- Palindromic decompositions with gaps and errors
- Palindromic length of words and morphisms in class \(\mathcal{P}\)
- Subword complexity and decomposition of the set of factors
- Remarks on privileged words
- Factorizing words over an ordered alphabet
- Diverse Palindromic Factorization Is NP-complete
- A characterization of subshifts with bounded powers
- A subquadratic algorithm for minimum palindromic factorization
- Diverse Palindromic Factorization is NP-Complete
- Greedy palindromic lengths
- A note on short palindromes in square-free words
- Palindromic sequences generated from marked morphisms
- On Morphisms Preserving Palindromic Richness
- scientific article; zbMATH DE number 7559452 (Why is no real title available?)
- Prefix palindromic length of the Thue-Morse word
- Palindromic decompositions with gaps and errors
- scientific article; zbMATH DE number 5279413 (Why is no real title available?)
- Smallest and Largest Block Palindrome Factorizations
- On some 2-binomial coefficients of binary words: geometrical interpretation, partitions of integers, and fair words
- The optimal upper bound on the MP-ratio for quaternary words
- And now there are four: another brick in the wall of the optimal upper bound on the MP-ratio
- Palindromic length of infinite aperiodic words
- Construction of Bernstein-based words and their patterns
- A metric characterisation of repulsive tilings
- On highly palindromic words: the ternary case
- Words with many palindrome pair factors
This page was built for publication: On palindromic factorization of words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394756)
