On the Palindromic Decomposition of Binary Words
Olexandr Ravsky · 2003
We prove a precise formula for the minimal number $K(n)$ such that every binary word of length $n$ can be divided into $K(n)$ palindromes. Also we estimate the average number $\bar K(n)$ of palindromes composing a random binary word of the length $n$.