Combinatorics on words has arisen independently within several branches of mathematics,
for instance, number theory, group theory and probability, and appears frequently in …

In this chapter, we will study symbolic sequences generated by an irrational rotation. Such
sequences appear each time a dynamical system has two rationally independent periods; …

Jn this survey paper, we present some recent results concerning finite and infinite Sturmian
words. We emphasize on the different definitions of Sturmian words, and various …

In this paper we study infinite episturmian words which are a natural generalization of
Sturmian words to an arbitrary alphabet. A characteristic property is: they are closed under …

The two parts of this text are based on two series of lectures delivered by Jean Berstel and
Christophe Reutenauer in March 2007 at the Centre de Recherches Mathematiques …

The analysis, verification, and control of hybrid automata with finite bisimulations can be
reduced to finite-state problems. We advocate a time-abstract, phase-based methodology for …

Infinite episturmian words are a generalization of Sturmian words which includes the Arnoux–
Rauzy sequences. We continue their study and that of episturmian morphisms, begun …

In this paper, we survey the rich theory of infinite episturmian words which generalize to any
finite alphabet, in a rather resembling way, the well-known family of Sturmian words on two …

An infinite word x over the alphabet A is Sturmian if and only if gx (n)= n+ 1 for any integer n,
where gx (n) is the number of distinct words of length n occurring in x. A palindrome is a …

Formal Languages, Automaton and Numeration Systems presents readers with a review of
research related to formal language theory, combinatorics on words or numeration systems …