We show that the permutation complexity of the image of a Sturmian word by abinary marked morphism is $n+k$ for some constant $k$ and all lengths $n$sufficiently large.Comment: 9 page
AbstractUsing the geometric dual technique by Berstel and Pocchiola, we give a uniform O(n3) upper b...
AbstractGiven a countable set X (usually taken to be N or Z), an infinite permutation π of X is a li...
Bell and Shallit recently introduced the Lie complexity of an infinite word s as the function counti...
In this paper, we define (k, l)-Sturmian words. Then, we study their complexity. Finally, we establi...
Two words are $k$-binomially equivalent if each subword of length at most $k$ occurs the same number...
Given a countable set X (usually taken to be N or Z), an infinite permutation pi of X is a linear or...
AbstractAn infinite word x over the alphabet A is Sturmian if and only if gx(n) = n + 1 for any inte...
The main topics of interest in this thesis will be two types of complexity, abelian complexity and p...
The main topics of interest in this thesis will be two types of complexity, abelian complexity and p...
The main topics of interest in this thesis will be two types of complexity, abelian complexity and p...
AbstractIn [7], Séébold (1998) announced that Sturmian words generated by morphisms are all rigid. T...
AbstractThis paper studies the pattern complexity of n-dimensional words. We show that an n-recurren...
We study properties of infinite permutations generated by fixed points of some uniform binary morphi...
We are grateful to Pascal Hubert for suggesting a term “equidistributed permutation” instead of “erg...
We are grateful to Pascal Hubert for suggesting a term “equidistributed permutation” instead of “erg...
AbstractUsing the geometric dual technique by Berstel and Pocchiola, we give a uniform O(n3) upper b...
AbstractGiven a countable set X (usually taken to be N or Z), an infinite permutation π of X is a li...
Bell and Shallit recently introduced the Lie complexity of an infinite word s as the function counti...
In this paper, we define (k, l)-Sturmian words. Then, we study their complexity. Finally, we establi...
Two words are $k$-binomially equivalent if each subword of length at most $k$ occurs the same number...
Given a countable set X (usually taken to be N or Z), an infinite permutation pi of X is a linear or...
AbstractAn infinite word x over the alphabet A is Sturmian if and only if gx(n) = n + 1 for any inte...
The main topics of interest in this thesis will be two types of complexity, abelian complexity and p...
The main topics of interest in this thesis will be two types of complexity, abelian complexity and p...
The main topics of interest in this thesis will be two types of complexity, abelian complexity and p...
AbstractIn [7], Séébold (1998) announced that Sturmian words generated by morphisms are all rigid. T...
AbstractThis paper studies the pattern complexity of n-dimensional words. We show that an n-recurren...
We study properties of infinite permutations generated by fixed points of some uniform binary morphi...
We are grateful to Pascal Hubert for suggesting a term “equidistributed permutation” instead of “erg...
We are grateful to Pascal Hubert for suggesting a term “equidistributed permutation” instead of “erg...
AbstractUsing the geometric dual technique by Berstel and Pocchiola, we give a uniform O(n3) upper b...
AbstractGiven a countable set X (usually taken to be N or Z), an infinite permutation π of X is a li...
Bell and Shallit recently introduced the Lie complexity of an infinite word s as the function counti...
DOI
Add to ORKG