FUNDAMENTALNAYA
I PRIKLADNAYA MATEMATIKA

(FUNDAMENTAL AND APPLIED MATHEMATICS)

2007, VOLUME 13, NUMBER 5, PAGES 213-224

**Balanced words and dynamical systems**

A. L. Chernyatiev

Abstract

View as HTML
View as gif image

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.

Location: http://mech.math.msu.su/~fpm/eng/k07/k075/k07510h.htm

Last modified: February 18, 2008