Properties of palindromes in finite words
Discrete Mathematics
2010-02-16 v1
Abstract
We present a method which displays all palindromes of a given length from De Bruijn words of a certain order, and also a recursive one which constructs all palindromes of length from the set of palindromes of length . We show that the palindrome complexity function, which counts the number of palindromes of each length contained in a given word, has a different shape compared with the usual (subword) complexity function. We give upper bounds for the average number of palindromes contained in all words of length , and obtain exact formulae for the number of palindromes of length 1 and 2 contained in all words of length .
Cite
@article{arxiv.1002.2723,
title = {Properties of palindromes in finite words},
author = {M-C. Anisiu and V. Anisiu and Z. Kasa},
journal= {arXiv preprint arXiv:1002.2723},
year = {2010}
}