Add to ORKGWe construct infinite cubefree binary words containing exponentially many distinct squares of length n . We also show that for every positive integer n , there is a cubefree binary square of length 2n.The first author is supported by an NSERC Discovery Grant. The second author is supported by an NSERC Postdoctoral Fellowship.http://dmtcs.episciences.org/48
Thue proved that the factors occurring infinitely many times in square-free words over {0,1,2} avoid...
AbstractIt is known that the number of overlap-free binary words of length n grows polynomially, whi...
Richomme asked the following question: what is the infimum of the real numbers α > 2 such that there...
Automata, Logic and SemanticsWe construct infinite cubefree binary words containing exponentially ma...
We study the structure of the language of binary cube-free words. Namely, we are interested in the c...
International audienceA square is the concatenation of a nonempty word with itself. A word has perio...
We study cube-free words over arbitrary non-unary finite alphabets and prove the following structura...
We study cube-free words over arbitrary non-unary finite alphabets and prove the following structura...
AbstractWe consider three aspects of avoiding large squares in infinite binary words. First, we cons...
A square is the concatenation of a nonempty word with itself. A word has period p if its letters at ...
We characterize the squares occurring in infinite overlap-free binary words and construct various α ...
Abstract. A square is the concatenation of a nonempty word with itself. A word has period p if its l...
There are circular square-free words of length n on three symbols for n≥18. This proves a conjecture...
The study of combinatorics on words dates back at least to the beginning of the 20th century and the...
We show that the number of ternary words of length n avoiding abelian cubes grows faster than r^n, ...
Thue proved that the factors occurring infinitely many times in square-free words over {0,1,2} avoid...
AbstractIt is known that the number of overlap-free binary words of length n grows polynomially, whi...
Richomme asked the following question: what is the infimum of the real numbers α > 2 such that there...
Automata, Logic and SemanticsWe construct infinite cubefree binary words containing exponentially ma...
We study the structure of the language of binary cube-free words. Namely, we are interested in the c...
International audienceA square is the concatenation of a nonempty word with itself. A word has perio...
We study cube-free words over arbitrary non-unary finite alphabets and prove the following structura...
We study cube-free words over arbitrary non-unary finite alphabets and prove the following structura...
AbstractWe consider three aspects of avoiding large squares in infinite binary words. First, we cons...
A square is the concatenation of a nonempty word with itself. A word has period p if its letters at ...
We characterize the squares occurring in infinite overlap-free binary words and construct various α ...
Abstract. A square is the concatenation of a nonempty word with itself. A word has period p if its l...
There are circular square-free words of length n on three symbols for n≥18. This proves a conjecture...
The study of combinatorics on words dates back at least to the beginning of the 20th century and the...
We show that the number of ternary words of length n avoiding abelian cubes grows faster than r^n, ...
Thue proved that the factors occurring infinitely many times in square-free words over {0,1,2} avoid...
AbstractIt is known that the number of overlap-free binary words of length n grows polynomially, whi...
Richomme asked the following question: what is the infimum of the real numbers α > 2 such that there...