Properties of palindromes in finite words

Details Properties of palindromes in finite words Properties of palindromes in finite words

2010-02-13

arxiv.org/abs/1002.2723v1

Pure Math. Appl. 17, 3-4 (2006) pp. 183-195

Computer Science

Discrete Mathematics

Scientific paper

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 $n+1$ from the set of palindromes of length $n$. 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 $n$, and obtain exact formulae for the number of palindromes of length 1 and 2 contained in all words of length $n$.

Affiliated with

Also associated with

No associations

Rating

Properties of palindromes in finite words does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Properties of palindromes in finite words, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Properties of palindromes in finite words will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-324129