Mathematics – Combinatorics
Scientific paper
2008-02-26
Theoretical Computer Science 407 (2008) 569--573
Mathematics
Combinatorics
7 pages
Scientific paper
10.1016/j.tcs.2008.06.009
In this paper we explore various interconnections between rich words, Sturmian words, and trapezoidal words. Rich words, first introduced in arXiv:0801.1656 by the second and third authors together with J. Justin and S. Widmer, constitute a new class of finite and infinite words characterized by having the maximal number of palindromic factors. Every finite Sturmian word is rich, but not conversely. Trapezoidal words were first introduced by the first author in studying the behavior of the subword complexity of finite Sturmian words. Unfortunately this property does not characterize finite Sturmian words. In this note we show that the only trapezoidal palindromes are Sturmian. More generally we show that Sturmian palindromes can be characterized either in terms of their subword complexity (the trapezoidal property) or in terms of their palindromic complexity. We also obtain a similar characterization of rich palindromes in terms of a relation between palindromic complexity and subword complexity.
Glen Amy
Luca Aldo de
Zamboni Luca Q.
No associations
LandOfFree
Rich, Sturmian, and trapezoidal 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 Rich, Sturmian, and trapezoidal words, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rich, Sturmian, and trapezoidal words will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-607256