Balanced words and dynamical systems
- 30 Downloads
This article is devoted to the description of all nonperiodic balanced words with n different letters. A superword W is called balanced if the numbers of equal letters in any two of its factors (subwords) u 1 and u 2 of equal length differ by at most 1. Balanced words are one of the possible generalizations of Sturmian words. We give a geometric interpretation of nonperiodic balanced sequences over an n-letter alphabet.
KeywordsBlue Color Regular Polygon Symbolic Dynamic Equivalence Theorem Antipodal Point
Unable to display preview. Download preview PDF.
- 2.Ya. G. Sinai, Introduction to Ergodic Theory [in Russian], FAZIS, Moscow (1996).Google Scholar
- 3.J. Berstel, “Recent results on Sturmian words,” in: Developments in Language Theory. II, World Scientific (1996), pp. 13–24.Google Scholar
- 6.M. Lothaire, “Combinatorics on words,” in: Encyclopedia of Mathematics and Its Applications, Vol. 17, Addison-Wesley, Reading (1983).Google Scholar
- 11.R. Tijdeman, “Decomposition of the integers as a direct sum of two subsets,” in: S. David, ed., Number Theory. Number Theory Seminar Paris 1992–93, Cambridge Univ. Press (1995), pp. 261–276.Google Scholar