AbstractWe describe an algorithm which, given a factor of a Sturmian word, computes the next factor of the same length in the lexicographic order in linear time. It is based on a combinatorial property of Sturmian words which is related with the Burrows–Wheeler transformation
AbstractIn this paper we use the relation of the index of an infinite aperiodic word and its recurre...
AbstractIn this paper we give a characterization of finite Sturmian words, by palindrome words, whic...
A finite Sturmian word w is a balanced word over the binary alphabet {a,b}, that is, for all subword...
International audienceWe describe an algorithm which, given a factor of a Sturmian word, computes th...
AbstractWe describe an algorithm which, given a factor of a Sturmian word, computes the next factor ...
AbstractWe introduce a new geometric approach to Sturmian words by means of a mapping that associate...
Communicated by Editor’s name The class of finite Sturmian words consists of words having particular...
AbstractIn this paper, we give some new characterizations of words which are finite factors of Sturm...
Communicated by Editor’s name The class of finite Sturmian words consists of words having particular...
In this paper we present three new characterizations of Sturmian words based on the lexicographic or...
In this paper, we define (k, l)-Sturmian words. Then, we study their complexity. Finally, we establi...
Combinatorics on words plays a fundamental role in various fields of mathematics, not to mention its...
AbstractWe present a bijection between the set of factors of given length of Sturmian words and some...
AbstractAn infinite word x over the alphabet A is Sturmian if and only if gx(n) = n + 1 for any inte...
We define a new class of sequences, sequences with grouped factors, in which all factors of a given ...
AbstractIn this paper we use the relation of the index of an infinite aperiodic word and its recurre...
AbstractIn this paper we give a characterization of finite Sturmian words, by palindrome words, whic...
A finite Sturmian word w is a balanced word over the binary alphabet {a,b}, that is, for all subword...
International audienceWe describe an algorithm which, given a factor of a Sturmian word, computes th...
AbstractWe describe an algorithm which, given a factor of a Sturmian word, computes the next factor ...
AbstractWe introduce a new geometric approach to Sturmian words by means of a mapping that associate...
Communicated by Editor’s name The class of finite Sturmian words consists of words having particular...
AbstractIn this paper, we give some new characterizations of words which are finite factors of Sturm...
Communicated by Editor’s name The class of finite Sturmian words consists of words having particular...
In this paper we present three new characterizations of Sturmian words based on the lexicographic or...
In this paper, we define (k, l)-Sturmian words. Then, we study their complexity. Finally, we establi...
Combinatorics on words plays a fundamental role in various fields of mathematics, not to mention its...
AbstractWe present a bijection between the set of factors of given length of Sturmian words and some...
AbstractAn infinite word x over the alphabet A is Sturmian if and only if gx(n) = n + 1 for any inte...
We define a new class of sequences, sequences with grouped factors, in which all factors of a given ...
AbstractIn this paper we use the relation of the index of an infinite aperiodic word and its recurre...
AbstractIn this paper we give a characterization of finite Sturmian words, by palindrome words, whic...
A finite Sturmian word w is a balanced word over the binary alphabet {a,b}, that is, for all subword...
DOI
Add to ORKG