Many combinatorial and arithmetical properties have been studied for infinite words ub associated with ß-integers. Here, new results describing return words and recurrence function for a special case of ub will be presented. The methods used here can be applied to more general infinite words, but the description then becomes rather technical.
We define a new class of languages of ω-words, strictly extending ω-regular languages. One way to pr...
We define a new class of languages of $\omega$-words, strictly extending$\omega$-regular languages. ...
We study the structure of infinite words obtained by coding rotations on partitions of the unit circ...
Many combinatorial and arithmetical properties have been studied for infinite words ub associated wi...
Considering each occurrence of a word w in a recurrent infinite word, we define the set of return wo...
peer reviewedIn this paper we study various modifications of the notion of uniform recurrence in mul...
Partial words are sequences over a finite alphabet that may contain wildcard symbols, called holes, ...
AbstractIn Section 1 we study the relations among some combinatorial properties of infinite words, e...
International audienceIt is commonly admitted that the origin of combinatorics on words goes back to...
AbstractWe study recurrence and periodicity in infinite words by using local conditions. In particul...
In one dimension, an infinite word is said to be recurrent if every prefix occurs at least twice. A ...
see also http://liafa.jussieu.fr/~vuillon/articles.htmlIn this article, we count the number of retur...
International audienceFor infinite words, we study the properties of uniform recurrence, which trans...
Article dans revue scientifique avec comité de lecture.A repetition in a word is a subword with the ...
We survey several quantitative problems on infinite words related to repetitions, recurrence, and pa...
We define a new class of languages of ω-words, strictly extending ω-regular languages. One way to pr...
We define a new class of languages of $\omega$-words, strictly extending$\omega$-regular languages. ...
We study the structure of infinite words obtained by coding rotations on partitions of the unit circ...
Many combinatorial and arithmetical properties have been studied for infinite words ub associated wi...
Considering each occurrence of a word w in a recurrent infinite word, we define the set of return wo...
peer reviewedIn this paper we study various modifications of the notion of uniform recurrence in mul...
Partial words are sequences over a finite alphabet that may contain wildcard symbols, called holes, ...
AbstractIn Section 1 we study the relations among some combinatorial properties of infinite words, e...
International audienceIt is commonly admitted that the origin of combinatorics on words goes back to...
AbstractWe study recurrence and periodicity in infinite words by using local conditions. In particul...
In one dimension, an infinite word is said to be recurrent if every prefix occurs at least twice. A ...
see also http://liafa.jussieu.fr/~vuillon/articles.htmlIn this article, we count the number of retur...
International audienceFor infinite words, we study the properties of uniform recurrence, which trans...
Article dans revue scientifique avec comité de lecture.A repetition in a word is a subword with the ...
We survey several quantitative problems on infinite words related to repetitions, recurrence, and pa...
We define a new class of languages of ω-words, strictly extending ω-regular languages. One way to pr...
We define a new class of languages of $\omega$-words, strictly extending$\omega$-regular languages. ...
We study the structure of infinite words obtained by coding rotations on partitions of the unit circ...