see also http://liafa.jussieu.fr/~vuillon/articles.htmlIn this article, we count the number of return words in some infinite words with complexity 2n+1. We also consider some infinite words given by codings of rotation and interval exchange transformations on k intervals. We prove that the number of return words over a given word w for these infinite words is exactly k
In this article, we study the complexity of drunken man infinite words. We show that these infinite...
AbstractThis paper contains answers to several problems in the theory of the computational complexit...
AbstractWe focus on infinite words with languages closed under reversal. If frequencies of all facto...
We study the structure of infinite words obtained by coding rotations on partitions of the unit circ...
Consiglio Nazionale delle Ricerche - Biblioteca Centrale - P.le Aldo Moro, 7 Rome / CNR - Consiglio ...
AbstractWe study the palindromic complexity of infinite words obtained by coding rotations on partit...
AbstractWe study the relation between the palindromic and factor complexity of infinite words. We sh...
We study the palindromic complexity of infinite words obtained by coding rotations on partitions of ...
Many combinatorial and arithmetical properties have been studied for infinite words ub associated wi...
AbstractIn Section 1 we study the relations among some combinatorial properties of infinite words, e...
Article dans revue scientifique avec comité de lecture.A repetition in a word is a subword with the ...
In this paper we prove that for any infinite word w whose set of factors is closed under reversal. t...
In present work we study connection between irrational rotations of the unit interval and infinite w...
This paper contains answers to several problems in the theory of the computational complexity of inf...
AbstractIn this paper we prove that for any infinite word w whose set of factors is closed under rev...
In this article, we study the complexity of drunken man infinite words. We show that these infinite...
AbstractThis paper contains answers to several problems in the theory of the computational complexit...
AbstractWe focus on infinite words with languages closed under reversal. If frequencies of all facto...
We study the structure of infinite words obtained by coding rotations on partitions of the unit circ...
Consiglio Nazionale delle Ricerche - Biblioteca Centrale - P.le Aldo Moro, 7 Rome / CNR - Consiglio ...
AbstractWe study the palindromic complexity of infinite words obtained by coding rotations on partit...
AbstractWe study the relation between the palindromic and factor complexity of infinite words. We sh...
We study the palindromic complexity of infinite words obtained by coding rotations on partitions of ...
Many combinatorial and arithmetical properties have been studied for infinite words ub associated wi...
AbstractIn Section 1 we study the relations among some combinatorial properties of infinite words, e...
Article dans revue scientifique avec comité de lecture.A repetition in a word is a subword with the ...
In this paper we prove that for any infinite word w whose set of factors is closed under reversal. t...
In present work we study connection between irrational rotations of the unit interval and infinite w...
This paper contains answers to several problems in the theory of the computational complexity of inf...
AbstractIn this paper we prove that for any infinite word w whose set of factors is closed under rev...
In this article, we study the complexity of drunken man infinite words. We show that these infinite...
AbstractThis paper contains answers to several problems in the theory of the computational complexit...
AbstractWe focus on infinite words with languages closed under reversal. If frequencies of all facto...