Add to ORKGThe set of unique $\beta$-expansions over the alphabet $\{0,1\}$ is trivial for $\beta$ below the golden ratio and uncountable above the Komornik-Loreti constant. Generalisations of these thresholds for three-letter alphabets were studied by Komornik, Lai and Pedicini (2011, 2017). We use S-adic words including the Thue-Morse word (which defines the Komornik-Loreti constant) and Sturmian words (which characterise generalised golden ratios) to determine the value of a certain generalisation of the Komornik-Loreti constant to three-letter alphabets
International audienceIn this article, we consider smooth words over 2-letter alphabets {a, b}, with...
The critical exponent of a finite or infinite word w over a given alphabet is the supremum of the re...
This thesis consists of three chapters including ten sections, which focus on beta-expansions, relat...
Glendinning and Sidorov discovered an important feature of the Komornik–Loreti constant q′≈ 1.78723 ...
AbstractThe study of the redundancy of non-integer base numeration systems involves several fields o...
Over a binary alphabet it is well-known that the aperiodic balanced words are exactly the Sturmian w...
Over a binary alphabet it is well-known that the aperiodic balanced words are exactly the Sturmian w...
AbstractLet S be a standard Sturmian word that is a fixed point of a non-trivial homomorphism. Assoc...
Let S be a standard Sturmian word that is a fixed point of a non-trivial homomorphism. Associated to...
In recent years, combinatorial properties of finite and infinite words have become increasingly impo...
International audienceThe exponent of a word is the ratio of its length over its smallest period. Th...
peer reviewedOver an alphabet of size 3 we construct an infinite balanced word with critical exponen...
In this paper, we define (k, l)-Sturmian words. Then, we study their complexity. Finally, we establi...
AbstractWe extend the theorem of Fine and Wilf to words having three periods. We then define the set...
The properties characterizing Sturmian words are considered for words on multiliteral alphabets. We ...
International audienceIn this article, we consider smooth words over 2-letter alphabets {a, b}, with...
The critical exponent of a finite or infinite word w over a given alphabet is the supremum of the re...
This thesis consists of three chapters including ten sections, which focus on beta-expansions, relat...
Glendinning and Sidorov discovered an important feature of the Komornik–Loreti constant q′≈ 1.78723 ...
AbstractThe study of the redundancy of non-integer base numeration systems involves several fields o...
Over a binary alphabet it is well-known that the aperiodic balanced words are exactly the Sturmian w...
Over a binary alphabet it is well-known that the aperiodic balanced words are exactly the Sturmian w...
AbstractLet S be a standard Sturmian word that is a fixed point of a non-trivial homomorphism. Assoc...
Let S be a standard Sturmian word that is a fixed point of a non-trivial homomorphism. Associated to...
In recent years, combinatorial properties of finite and infinite words have become increasingly impo...
International audienceThe exponent of a word is the ratio of its length over its smallest period. Th...
peer reviewedOver an alphabet of size 3 we construct an infinite balanced word with critical exponen...
In this paper, we define (k, l)-Sturmian words. Then, we study their complexity. Finally, we establi...
AbstractWe extend the theorem of Fine and Wilf to words having three periods. We then define the set...
The properties characterizing Sturmian words are considered for words on multiliteral alphabets. We ...
International audienceIn this article, we consider smooth words over 2-letter alphabets {a, b}, with...
The critical exponent of a finite or infinite word w over a given alphabet is the supremum of the re...
This thesis consists of three chapters including ten sections, which focus on beta-expansions, relat...