The properties characterizing Sturmian words are considered for words on multiliteral alphabets. We summarize various generalizations of Sturmian words to multiliteral alphabets and enlarge the list of known relationships among these generalizations. We provide a new equivalent definition of rich words and make use of it in the study of generalizations of Sturmian words based on palindromes. We also collect many examples of infinite words to illustrate differences in the generalized definitions of Sturmian words
In this paper we explore various interconnections between rich words, Sturmian words, and trapezoida...
International audienceWe consider Sturmian trees as a natural generalization of Sturmian words. A St...
AbstractPattern Sturmian words introduced by Kamae and Zamboni [Sequence entropy and the maximal pat...
The properties characterizing Sturmian words are considered for words on multiliteral alphabets. We ...
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 explore various interconnections between rich words, Sturmian words, and tr...
ABSTRACT. In this paper we explore various interconnections between rich words, Sturmian words, and ...
In this paper, we define (k, l)-Sturmian words. Then, we study their complexity. Finally, we establi...
This overview paper is devoted to Sturmian words. The first part summarizes different characterizati...
Sturmian words are in nite words over a two-letter alphabet that admit a great number of equivalen...
AbstractWe introduce a new geometric approach to Sturmian words by means of a mapping that associate...
Combinatorics on words plays a fundamental role in various fields of mathematics, not to mention its...
In recent years, combinatorial properties of finite and infinite words have become increasingly impo...
Trapezoidal words are finite words having at most n+1 distinct factors of length n, for every n>=...
A balanced word is one in which any two factors of the same length contain the same number of each l...
In this paper we explore various interconnections between rich words, Sturmian words, and trapezoida...
International audienceWe consider Sturmian trees as a natural generalization of Sturmian words. A St...
AbstractPattern Sturmian words introduced by Kamae and Zamboni [Sequence entropy and the maximal pat...
The properties characterizing Sturmian words are considered for words on multiliteral alphabets. We ...
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 explore various interconnections between rich words, Sturmian words, and tr...
ABSTRACT. In this paper we explore various interconnections between rich words, Sturmian words, and ...
In this paper, we define (k, l)-Sturmian words. Then, we study their complexity. Finally, we establi...
This overview paper is devoted to Sturmian words. The first part summarizes different characterizati...
Sturmian words are in nite words over a two-letter alphabet that admit a great number of equivalen...
AbstractWe introduce a new geometric approach to Sturmian words by means of a mapping that associate...
Combinatorics on words plays a fundamental role in various fields of mathematics, not to mention its...
In recent years, combinatorial properties of finite and infinite words have become increasingly impo...
Trapezoidal words are finite words having at most n+1 distinct factors of length n, for every n>=...
A balanced word is one in which any two factors of the same length contain the same number of each l...
In this paper we explore various interconnections between rich words, Sturmian words, and trapezoida...
International audienceWe consider Sturmian trees as a natural generalization of Sturmian words. A St...
AbstractPattern Sturmian words introduced by Kamae and Zamboni [Sequence entropy and the maximal pat...