Computer Science – Formal Languages and Automata Theory
Scientific paper
2012-04-07
Computer Science
Formal Languages and Automata Theory
Submitted
Scientific paper
A finite Sturmian word w over the alphabet {a,b} is left special (resp. right special) if aw and bw (resp. wa and wb) are both Sturmian words. A bispecial Sturmian word is a Sturmian word that is both left and right special. We show as a main result that bispecial Sturmian words are exactly the maximal internal factors of Christoffel words, that are words coding the digital approximations of segments in the Euclidean plane. This result is an extension of the known relation between central words and primitive Christoffel words. Our characterization allows us to give an enumerative formula for bispecial Sturmian words. We also investigate the minimal forbidden words for the set of Sturmian words.
No associations
LandOfFree
A Characterization of Bispecial Sturmian 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 A Characterization of Bispecial Sturmian Words, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Characterization of Bispecial Sturmian Words will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-37434