A Parry number is a real number β > 1 such that the Rényi β-expansion of 1 is finite or infinite eventually periodic. If this expansion is finite, β is said to be a simple Parry number. Remind that any Pisot number is a Parry number. In a previous work we have determined the complexity of the fixed point uβ of the canonical substitution associated with β-expansions, when β is a simple Parry number. In this paper we consider the case where β is a non-simple Parry number. We determine the structure of infinite left special branches, which are an important tool for the computation of the complexity of uβ. These results allow in particular to obtain the following characterization: the infinite word uβ is Sturmian if and only if β is a quadratic...
International audienceThis paper studies tilings and representation sapces related to the β-transfor...
In this article, we are dealing with -numeration, which is a generalization of numeration in a non-i...
This thesis deals with Abelian complexity of infinite words, i.e., function describing complexity of...
International audienceA Parry number is a real number β > 1 such that the Rényi β-expansion of 1 is ...
Abstract. We study the palindromic complexity of infinite words u β , the fixed points of the substi...
We study the palindromic complexity of infinite words uβ, the fixed points of the substitution over ...
Beta-integers ("β-integers") are those numbers which are the counterparts of integers when real numb...
AbstractWe derive an explicit formula for the Abelian complexity of infinite words associated with q...
During this presentatation, I introduice the new theory of the alternate bases. In this generalizati...
Abstract. Given a number β>1, the beta-transformation T = Tβ is defined for x ∈ [0,1] by Tx: = βx...
AbstractIn Section 1 we study the relations among some combinatorial properties of infinite words, e...
In this article, we are dealing with β-numeration, which is a generalization of numeration in a non-...
In this article, we are dealing with β-numeration, which is a generalization of numeration in a no...
A beta expansion is the analogue of the base 10 representation of a real number, where the base may ...
Abstract. We study rational numbers with purely periodic Rényi β-expansions. For bases β satisfying ...
International audienceThis paper studies tilings and representation sapces related to the β-transfor...
In this article, we are dealing with -numeration, which is a generalization of numeration in a non-i...
This thesis deals with Abelian complexity of infinite words, i.e., function describing complexity of...
International audienceA Parry number is a real number β > 1 such that the Rényi β-expansion of 1 is ...
Abstract. We study the palindromic complexity of infinite words u β , the fixed points of the substi...
We study the palindromic complexity of infinite words uβ, the fixed points of the substitution over ...
Beta-integers ("β-integers") are those numbers which are the counterparts of integers when real numb...
AbstractWe derive an explicit formula for the Abelian complexity of infinite words associated with q...
During this presentatation, I introduice the new theory of the alternate bases. In this generalizati...
Abstract. Given a number β>1, the beta-transformation T = Tβ is defined for x ∈ [0,1] by Tx: = βx...
AbstractIn Section 1 we study the relations among some combinatorial properties of infinite words, e...
In this article, we are dealing with β-numeration, which is a generalization of numeration in a non-...
In this article, we are dealing with β-numeration, which is a generalization of numeration in a no...
A beta expansion is the analogue of the base 10 representation of a real number, where the base may ...
Abstract. We study rational numbers with purely periodic Rényi β-expansions. For bases β satisfying ...
International audienceThis paper studies tilings and representation sapces related to the β-transfor...
In this article, we are dealing with -numeration, which is a generalization of numeration in a non-i...
This thesis deals with Abelian complexity of infinite words, i.e., function describing complexity of...