Abstract. For a given Sturmian word s, we consider the minimal β-shift containing the shift space generated by s. In this note we characterize such β, and investigate its dynamical, topological and number theoretical properties. 1. Introduction. Sturmian words are infinite words over binary alphabet A whose factors of length n are exactly n + 1. It is known that Sturmian words are aperiodic infinite words with minimal complexity [8]. These critical words admit some equivalent definitions in different manners. They can be coded from the irrational billiards on a uni
AbstractOne of the numerous characterizations of Sturmian words is based on the notion of balance. A...
AbstractReturn words constitute a powerful tool for studying symbolic dynamical systems. They may be...
AbstractIn Section 1 we study the relations among some combinatorial properties of infinite words, e...
AbstractConsider the minimal β-shift containing the shift space generated by a given Sturmian word. ...
In this paper, we define (k, l)-Sturmian words. Then, we study their complexity. Finally, we establi...
Abstract. We say x ∈ {0, 1, 2}N is a word with Sturmian erasures if for any a ∈ {0, 1, 2} the word o...
This overview paper is devoted to Sturmian words. The first part summarizes different characterizati...
www.elsevier.com/locate/disc Pattern Sturmian words introduced by Kamae and Zamboni [Sequence entrop...
International audienceIn this extended abstract, we discuss the minimal subword complexity and the m...
AbstractPattern Sturmian words introduced by Kamae and Zamboni [Sequence entropy and the maximal pat...
AbstractLet S be a standard Sturmian word that is a fixed point of a non-trivial homomorphism. Assoc...
Abstract. Sturmian words are infinite words that have exactly n+ 1 factors of length n for every pos...
In recent years, combinatorial properties of finite and infinite words have become increasingly impo...
Let S be a standard Sturmian word that is a fixed point of a non-trivial homomorphism. Associated to...
AbstractMichaux and Villemaire's proof of Cobham's theorem relies on the characterization of ultimat...
AbstractOne of the numerous characterizations of Sturmian words is based on the notion of balance. A...
AbstractReturn words constitute a powerful tool for studying symbolic dynamical systems. They may be...
AbstractIn Section 1 we study the relations among some combinatorial properties of infinite words, e...
AbstractConsider the minimal β-shift containing the shift space generated by a given Sturmian word. ...
In this paper, we define (k, l)-Sturmian words. Then, we study their complexity. Finally, we establi...
Abstract. We say x ∈ {0, 1, 2}N is a word with Sturmian erasures if for any a ∈ {0, 1, 2} the word o...
This overview paper is devoted to Sturmian words. The first part summarizes different characterizati...
www.elsevier.com/locate/disc Pattern Sturmian words introduced by Kamae and Zamboni [Sequence entrop...
International audienceIn this extended abstract, we discuss the minimal subword complexity and the m...
AbstractPattern Sturmian words introduced by Kamae and Zamboni [Sequence entropy and the maximal pat...
AbstractLet S be a standard Sturmian word that is a fixed point of a non-trivial homomorphism. Assoc...
Abstract. Sturmian words are infinite words that have exactly n+ 1 factors of length n for every pos...
In recent years, combinatorial properties of finite and infinite words have become increasingly impo...
Let S be a standard Sturmian word that is a fixed point of a non-trivial homomorphism. Associated to...
AbstractMichaux and Villemaire's proof of Cobham's theorem relies on the characterization of ultimat...
AbstractOne of the numerous characterizations of Sturmian words is based on the notion of balance. A...
AbstractReturn words constitute a powerful tool for studying symbolic dynamical systems. They may be...
AbstractIn Section 1 we study the relations among some combinatorial properties of infinite words, e...