Add to ORKGSturmian words are in nite words over a two-letter alphabet that admit a great number of equivalent de nitions. Most of them have been given in the past ten years. Among several extensions of Sturmian words to larger alphabets, the Arnoux-Rauzy words appear to share many of the properties of Sturmian words. In this survey, combinatorial properties of these two families are considered and compared
International audienceWe extend classical Ostrowski numeration systems, closely related to Sturmian ...
Trapezoidal words are words having at most n+1 distinct factors of length n for every n≥0. They ther...
Combinatorics on words plays a fundamental role in various fields of mathematics, not to mention its...
In this paper, we define (k, l)-Sturmian words. Then, we study their complexity. Finally, we establi...
The properties characterizing Sturmian words are considered for words on multiliteral alphabets. We ...
In recent years, combinatorial properties of finite and infinite words have become increasingly impo...
This overview paper is devoted to Sturmian words. The first part summarizes different characterizati...
In this paper, we investigate some combinatorial properties concerning the family of the so-called T...
AbstractWe introduce a new geometric approach to Sturmian words by means of a mapping that associate...
AbstractRecall that a semigroup has the property Pn∗ if for any sequence of n of its elements, two d...
AbstractAn infinite word x over the alphabet A is Sturmian if and only if gx(n) = n + 1 for any inte...
AbstractIn this paper, we introduce the singular words of Sturmian sequences, which play an importan...
A balanced word is one in which any two factors of the same length contain the same number of each l...
AbstractIn this paper we define Sturmian graphs and we prove that all of them have a certain “counti...
Communicated by Editor’s name The class of finite Sturmian words consists of words having particular...
International audienceWe extend classical Ostrowski numeration systems, closely related to Sturmian ...
Trapezoidal words are words having at most n+1 distinct factors of length n for every n≥0. They ther...
Combinatorics on words plays a fundamental role in various fields of mathematics, not to mention its...
In this paper, we define (k, l)-Sturmian words. Then, we study their complexity. Finally, we establi...
The properties characterizing Sturmian words are considered for words on multiliteral alphabets. We ...
In recent years, combinatorial properties of finite and infinite words have become increasingly impo...
This overview paper is devoted to Sturmian words. The first part summarizes different characterizati...
In this paper, we investigate some combinatorial properties concerning the family of the so-called T...
AbstractWe introduce a new geometric approach to Sturmian words by means of a mapping that associate...
AbstractRecall that a semigroup has the property Pn∗ if for any sequence of n of its elements, two d...
AbstractAn infinite word x over the alphabet A is Sturmian if and only if gx(n) = n + 1 for any inte...
AbstractIn this paper, we introduce the singular words of Sturmian sequences, which play an importan...
A balanced word is one in which any two factors of the same length contain the same number of each l...
AbstractIn this paper we define Sturmian graphs and we prove that all of them have a certain “counti...
Communicated by Editor’s name The class of finite Sturmian words consists of words having particular...
International audienceWe extend classical Ostrowski numeration systems, closely related to Sturmian ...
Trapezoidal words are words having at most n+1 distinct factors of length n for every n≥0. They ther...
Combinatorics on words plays a fundamental role in various fields of mathematics, not to mention its...