DOIAbstract
AbstractAn alternative proof of Shyr–Yu theorem is given. Some generalizations are also considered using fractional root decompositions and fractional exponents of words
AbstractAn alternative proof of Shyr–Yu theorem is given. Some generalizations are also considered using fractional root decompositions and fractional exponents of words
AbstractWe prove that if x0u1ix1u2ix2 = y0v1iy1v2iy2 holds for all i ϵ {0, 1, 2, 3}, then it is true...
Primitive word is a word that can not be represented by any repetition of shorter words. Since every...
We study cube-free words over arbitrary non-unary finite alphabets and prove the following structura...
International audienceAn alternative proof of Shyr-Yu theorem is given. Some generalizations are als...
AbstractAn alternative proof of Shyr–Yu theorem is given. Some generalizations are also considered u...
AbstractSome observations on products of primitive words are discussed. By these results, alternativ...
AbstractThe authors show that for a natural number k and a finite alphabet Σ the set of ω-words over...
The recently confirmed Dejean's conjecture about the threshold between avoidable and unavoidable pow...
Combinatorics on words is a relatively recent area of discrete mathematics, which finds its roots in...
The recently confirmed Dejean?fs conjecture about the threshold between avoidable and unavoidable po...
We study the lexicographically least infinite $a/b$-power-free word on the alphabet of non-negative ...
Blanched-Sadri and Woodhouse in 2013 have proven the conjecture of Cassaigne, stating that any patte...
AbstractIt is known that the sequence 1,2,1,1,2,2,2,1,1,2,1,1,2,1,1,2,2,… of lengths of blocks of id...
International audienceFor all α ≥ RT (3) (where RT (3) = 7/4 is the repetition threshold for the 3-l...
AbstractIt is known that the number of overlap-free binary words of length n grows polynomially, whi...
AbstractWe prove that if x0u1ix1u2ix2 = y0v1iy1v2iy2 holds for all i ϵ {0, 1, 2, 3}, then it is true...
Primitive word is a word that can not be represented by any repetition of shorter words. Since every...
We study cube-free words over arbitrary non-unary finite alphabets and prove the following structura...
International audienceAn alternative proof of Shyr-Yu theorem is given. Some generalizations are als...
AbstractAn alternative proof of Shyr–Yu theorem is given. Some generalizations are also considered u...
AbstractSome observations on products of primitive words are discussed. By these results, alternativ...
AbstractThe authors show that for a natural number k and a finite alphabet Σ the set of ω-words over...
The recently confirmed Dejean's conjecture about the threshold between avoidable and unavoidable pow...
Combinatorics on words is a relatively recent area of discrete mathematics, which finds its roots in...
The recently confirmed Dejean?fs conjecture about the threshold between avoidable and unavoidable po...
We study the lexicographically least infinite $a/b$-power-free word on the alphabet of non-negative ...
Blanched-Sadri and Woodhouse in 2013 have proven the conjecture of Cassaigne, stating that any patte...
AbstractIt is known that the sequence 1,2,1,1,2,2,2,1,1,2,1,1,2,1,1,2,2,… of lengths of blocks of id...
International audienceFor all α ≥ RT (3) (where RT (3) = 7/4 is the repetition threshold for the 3-l...
AbstractIt is known that the number of overlap-free binary words of length n grows polynomially, whi...
AbstractWe prove that if x0u1ix1u2ix2 = y0v1iy1v2iy2 holds for all i ϵ {0, 1, 2, 3}, then it is true...
Primitive word is a word that can not be represented by any repetition of shorter words. Since every...
We study cube-free words over arbitrary non-unary finite alphabets and prove the following structura...
Add to ORKG