On the palindromic decomposition of binary words
Combinatorics
2011-05-20 v1
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 of palindromes composing a random binary word of the length n.
Keywords
Cite
@article{arxiv.1004.1278,
title = {On the palindromic decomposition of binary words},
author = {Alex Ravsky},
journal= {arXiv preprint arXiv:1004.1278},
year = {2011}
}
Comments
9 pages