AbstractIn this paper, we characterize by lexicographic order all finite Sturmian and episturmian words, i.e., all (finite) factors of such infinite words. Consequently, we obtain a characterization of infinite episturmian words in a wide sense (episturmian and episkew infinite words). That is, we characterize the set of all infinite words whose factors are (finite) episturmian. Similarly, we characterize by lexicographic order all balanced infinite words over a 2-letter alphabet; in other words, all Sturmian and skew infinite words, the factors of which are (finite) Sturmian
AbstractAn infinite word x over the alphabet A is Sturmian if and only if gx(n) = n + 1 for any inte...
AbstractThis paper concerns a specific class of strict standard episturmian words whose directive wo...
AbstractEpisturmian sequences are a natural extension of Sturmian sequences to the case of finite al...
In this paper, we survey the rich theory of infinite episturmian words which generalize to any finit...
AbstractConsidering the smallest and the greatest factors with respect to the lexicographic order we...
In recent years, combinatorial properties of finite and infinite words have become increasingly impo...
Considering each occurrence of a word w in a recurrent infinite word, we define the set of return wo...
AbstractIn this paper we study infinite episturmian words which are a natural generalization of Stur...
In this paper we present three new characterizations of Sturmian words based on the lexicographic or...
AbstractLet w be an infinite word on an alphabet A. We denote by (ni)i⩾1 the increasing sequence (as...
AbstractInfinite episturmian words are a generalization of Sturmian words which includes the Arnoux–...
Combinatorics on words plays a fundamental role in various fields of mathematics, not to mention its...
AbstractIn this paper we study some classes of infinite words generalizing episturmian words, and an...
AbstractIn this paper we give a characterization of finite Sturmian words, by palindrome words, whic...
AbstractIn this paper, we give some new characterizations of words which are finite factors of Sturm...
AbstractAn infinite word x over the alphabet A is Sturmian if and only if gx(n) = n + 1 for any inte...
AbstractThis paper concerns a specific class of strict standard episturmian words whose directive wo...
AbstractEpisturmian sequences are a natural extension of Sturmian sequences to the case of finite al...
In this paper, we survey the rich theory of infinite episturmian words which generalize to any finit...
AbstractConsidering the smallest and the greatest factors with respect to the lexicographic order we...
In recent years, combinatorial properties of finite and infinite words have become increasingly impo...
Considering each occurrence of a word w in a recurrent infinite word, we define the set of return wo...
AbstractIn this paper we study infinite episturmian words which are a natural generalization of Stur...
In this paper we present three new characterizations of Sturmian words based on the lexicographic or...
AbstractLet w be an infinite word on an alphabet A. We denote by (ni)i⩾1 the increasing sequence (as...
AbstractInfinite episturmian words are a generalization of Sturmian words which includes the Arnoux–...
Combinatorics on words plays a fundamental role in various fields of mathematics, not to mention its...
AbstractIn this paper we study some classes of infinite words generalizing episturmian words, and an...
AbstractIn this paper we give a characterization of finite Sturmian words, by palindrome words, whic...
AbstractIn this paper, we give some new characterizations of words which are finite factors of Sturm...
AbstractAn infinite word x over the alphabet A is Sturmian if and only if gx(n) = n + 1 for any inte...
AbstractThis paper concerns a specific class of strict standard episturmian words whose directive wo...
AbstractEpisturmian sequences are a natural extension of Sturmian sequences to the case of finite al...