AbstractThe authors show that for a natural number k and a finite alphabet Σ the set of ω-words over Σ avoiding xk is either empty or perfect. This leads to an algorithm to determine which k-power free words over Σ extend to k-power free ω-words over Σ
Richomme asked the following question: what is the infimum of the real numbers α > 2 such that there...
The recently confirmed Dejean?fs conjecture about the threshold between avoidable and unavoidable po...
AbstractA word is cubefree if it contains no non-empty subword of the form xxx. A morphism h:Σ∗→Σ∗ i...
AbstractThe branching of the tree of k-power free words is explored. It is shown that the set of k-p...
We study cube-free words over arbitrary non-unary finite alphabets and prove the following structura...
AbstractOne way to generate infinite k-power-free words is to iterate a k-power-free morphism, that ...
We study cube-free words over arbitrary non-unary finite alphabets and prove the following structura...
We study the lexicographically least infinite $a/b$-power-free word on the alphabet of non-negative ...
We prove a Fife-like characterization of the infinite binary 7/3-power-free words, by giving a finit...
AbstractWe study the number uα(n) of α-power-free binary words of length n, and the asymptotics of t...
AbstractThe paper approaches the classical combinatorial problem of freeness of words, in the more g...
Let $L_{k,\alpha}^{\mathbb{Z}}$ denote the set of all bi-infinite $\alpha$-power free words over an ...
AbstractAn infinite square-free word w over a three letter alphabet T is said to have a k-stem σ if ...
The paper approaches the classical combinatorial problem of free-ness of words, in the more general ...
The recently confirmed Dejean's conjecture about the threshold between avoidable and unavoidable pow...
Richomme asked the following question: what is the infimum of the real numbers α > 2 such that there...
The recently confirmed Dejean?fs conjecture about the threshold between avoidable and unavoidable po...
AbstractA word is cubefree if it contains no non-empty subword of the form xxx. A morphism h:Σ∗→Σ∗ i...
AbstractThe branching of the tree of k-power free words is explored. It is shown that the set of k-p...
We study cube-free words over arbitrary non-unary finite alphabets and prove the following structura...
AbstractOne way to generate infinite k-power-free words is to iterate a k-power-free morphism, that ...
We study cube-free words over arbitrary non-unary finite alphabets and prove the following structura...
We study the lexicographically least infinite $a/b$-power-free word on the alphabet of non-negative ...
We prove a Fife-like characterization of the infinite binary 7/3-power-free words, by giving a finit...
AbstractWe study the number uα(n) of α-power-free binary words of length n, and the asymptotics of t...
AbstractThe paper approaches the classical combinatorial problem of freeness of words, in the more g...
Let $L_{k,\alpha}^{\mathbb{Z}}$ denote the set of all bi-infinite $\alpha$-power free words over an ...
AbstractAn infinite square-free word w over a three letter alphabet T is said to have a k-stem σ if ...
The paper approaches the classical combinatorial problem of free-ness of words, in the more general ...
The recently confirmed Dejean's conjecture about the threshold between avoidable and unavoidable pow...
Richomme asked the following question: what is the infimum of the real numbers α > 2 such that there...
The recently confirmed Dejean?fs conjecture about the threshold between avoidable and unavoidable po...
AbstractA word is cubefree if it contains no non-empty subword of the form xxx. A morphism h:Σ∗→Σ∗ i...
DOI
Add to ORKG