Palindrome complexity

Details Palindrome complexity Palindrome complexity

2001-06-14

arxiv.org/abs/math/0106121v1

Theor. Comput. Science 292 (2003) 9 - 31

Mathematics

Combinatorics

24 pages, dedicated to Jean Berstel for his 60th birthday

Scientific paper

We study the palindrome complexity of infinite sequences on finite alphabets, i.e., the number of palindromic factors (blocks) of given length occurring in a given sequence. We survey the known results and obtain new results for some sequences, in particular for Rote sequences and for fixed points of primitive morphisms of constant length belonging to the class P substitutions of Hof-Knill-Simon. We also give an upper bound for the palindrome complexity of a sequence in terms of its (block-)complexity.

Affiliated with

Also associated with

No associations

Rating

Palindrome complexity 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 Palindrome complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Palindrome complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-275936