Computer Science – Formal Languages and Automata Theory
Scientific paper
2011-08-18
EPTCS 63, 2011, pp. 179-188
Computer Science
Formal Languages and Automata Theory
In Proceedings WORDS 2011, arXiv:1108.3412
Scientific paper
10.4204/EPTCS.63.24
In this paper we study an abelian version of the notion of return word. Our main result is a new characterization of Sturmian words via abelian returns. Namely, we prove that a word is Sturmian if and only if each of its factors has two or three abelian returns. In addition, we describe the structure of abelian returns in Sturmian words, and discuss connections between abelian returns and periodicity.
Puzynina Svetlana
Zamboni Luca Q.
No associations
LandOfFree
Abelian returns in 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 Abelian returns in Sturmian words, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Abelian returns in Sturmian words will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-180639