Abstract
We prove a precise formula for the minimal number K(n) such that every binary word of length can be divided into K(n) palindromes. Also we estimate the average number $\ol K(n)$ of palindromes composing a random binary word of the length n.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.