Palindromes In Sturmian Strings

Details Palindromes In Sturmian Strings Palindromes In Sturmian Strings

2010-02-24

arxiv.org/abs/1002.4606v2

Mathematics

Combinatorics

13 pages

Scientific paper

Let p be a maximal palindrome in a Sturmian word s=ul_1pl_2v so that p is a palindrome and l_1pl_2 is not for letters l_1 and l_2. Let {\alpha}(p,p') be a morphism mapping letters a and b respectively to a^pb and a^p'b, |p-p'|=1. In this paper, we characterize the palindromes in a Sturmian word and show that the number of maximal palindromes in a Sturmian word X= {\alpha}(p,p')(Y) for finite Y and thus X is 2|X|-2|Y|. We show that the set of maximal palindromes in a finite Sturmian word X has the cardinality {\Sigma} i=1..n max(pi,p'i) where X is characterized by subsequent mappings of i=1..n.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-261087