AbstractThe paper is devoted to the properties of infinite permutations. We introduce the infinite permutation ξ, in some sense similar to the period doubling word w (which is the fixed point of the morphism φw:0↦0100,1↦0101). We investigate combinatorial properties of ξ and find the complexity of ξ
AbstractLetwRdenote the reversal of the wordw, and letwE=w. We examine a generalization of Mendès Fr...
AbstractWe consider the infinite one-sided sequence generated by the period-doubling substitution. T...
International audienceAn infinite permutation can be defined as a linear ordering of the set of natu...
We define an infinite permutation as a sequence of reals taken up to the order, or, equivalently, as...
AbstractGiven a countable set X (usually taken to be N or Z), an infinite permutation π of X is a li...
We study properties of infinite permutations generated by fixed points of some uniform binary morphi...
AbstractWe define an infinite permutation as a sequence of reals taken up to value, or, equivalently...
Given a countable set X (usually taken to be N or Z), an infinite permutation pi of X is a linear or...
Given a countable set X (usually taken to be N or Z), an infinite permutation π of X is a linear ord...
AbstractAn infinite permutation α is a linear ordering of N. We study properties of infinite permuta...
AbstractIn Section 1 we study the relations among some combinatorial properties of infinite words, e...
We are grateful to Pascal Hubert for suggesting a term “equidistributed permutation” instead of “erg...
peer reviewedGiven a morphism h prolongable on a and an integer p, we present an algorithm that calc...
Here, we consider a central notion of word combinatorics and string algorithmics: the periods of a s...
AbstractWe study the relation between the palindromic and factor complexity of infinite words. We sh...
AbstractLetwRdenote the reversal of the wordw, and letwE=w. We examine a generalization of Mendès Fr...
AbstractWe consider the infinite one-sided sequence generated by the period-doubling substitution. T...
International audienceAn infinite permutation can be defined as a linear ordering of the set of natu...
We define an infinite permutation as a sequence of reals taken up to the order, or, equivalently, as...
AbstractGiven a countable set X (usually taken to be N or Z), an infinite permutation π of X is a li...
We study properties of infinite permutations generated by fixed points of some uniform binary morphi...
AbstractWe define an infinite permutation as a sequence of reals taken up to value, or, equivalently...
Given a countable set X (usually taken to be N or Z), an infinite permutation pi of X is a linear or...
Given a countable set X (usually taken to be N or Z), an infinite permutation π of X is a linear ord...
AbstractAn infinite permutation α is a linear ordering of N. We study properties of infinite permuta...
AbstractIn Section 1 we study the relations among some combinatorial properties of infinite words, e...
We are grateful to Pascal Hubert for suggesting a term “equidistributed permutation” instead of “erg...
peer reviewedGiven a morphism h prolongable on a and an integer p, we present an algorithm that calc...
Here, we consider a central notion of word combinatorics and string algorithmics: the periods of a s...
AbstractWe study the relation between the palindromic and factor complexity of infinite words. We sh...
AbstractLetwRdenote the reversal of the wordw, and letwE=w. We examine a generalization of Mendès Fr...
AbstractWe consider the infinite one-sided sequence generated by the period-doubling substitution. T...
International audienceAn infinite permutation can be defined as a linear ordering of the set of natu...
DOI
Add to ORKG