Sur un théorème de Thue
From MaRDI portal
Publication:2555163
DOI10.1016/0097-3165(72)90011-8zbMath0245.20052OpenAlexW2061829075WikidataQ57253991 ScholiaQ57253991MaRDI QIDQ2555163
Publication date: 1972
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(72)90011-8
Free semigroups, generators and relations, word problems (20M05) Word problems, etc. in computability and recursion theory (03D40)
Related Items
Abelian combinatorics on words: a survey, SQUARE COMPLETION OPERATION OF MAXIMAL SUFFIX IN FIBONACCI WORD, Critical Exponents of Regular Arnoux-Rauzy Sequences, Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings, Extensions and reductions of squarefree words, An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence, Fractional meanings of nonrepetitiveness, Repetition-free words, Transition Property for $$\alpha $$-Power Free Languages with $$\alpha \ge 2$$ and $$k\ge 3$$ Letters, The critical exponent functions, Branching frequency and Markov entropy of repetition-free languages, A proof of Dejean’s conjecture, On repeated factors in \(C^\infty\)-words, Reversals and palindromes in continued fractions, Letter frequency in infinite repetition-free words, On the structure and extendibility of \(k\)-power free words, \((2+\epsilon )\)-nonrepetitive list colouring of paths, Avoiding letter patterns in ternary square-free words, ON THE EXISTENCE OF MINIMAL β-POWERS, Fewest repetitions in infinite binary words, Repetition thresholds for subdivided graphs and trees, On Abelian repetition threshold, Reduction in non-(k+ 1)-power-free morphisms, Multidimensional unrepetitive configurations, Unnamed Item, Non-repetitive words: Ages and essences, Dejean's conjecture and Sturmian words, Polynomial versus exponential growth in repetition-free binary words, Repetitions in the Fibonacci infinite word, The undirected repetition threshold and undirected pattern avoidance, Growth of power-free languages over large alphabets, On non-repetitive sequences of arithmetic progressions: the cases \(k\in\{4,5,6,7,8\}\), Growth of power-free languages: numerical and asymptotic bounds, On minimal critical exponent of balanced sequences, Infinite words containing the minimal number of repetitions, The easily bored sequence, Minimal critical exponent of quasiperiodic words, Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture, Approaching repetition thresholds via local resampling and entropy compression, Interview with Jeffrey Shallit, Avoiding 3/2-powers over the natural numbers, The set of \(k\)-power free words over \(\Sigma\) is empty or perfect, Mots sans carre et morphismes iterés, Avoiding 5/4-powers on the alphabet of nonnegative integers, Computing maximal-exponent factors in an overlap-free word, Cancellation in semigroups in which \(x^ 2=x^ 3\), Avoiding or Limiting Regularities in Words, Avoidance of split overlaps, Extremal overlap-free and extremal \(\beta\)-free binary words, On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters, Fewest repetitions versus maximal-exponent powers in infinite binary words, On extremal properties of the Fibonacci word, Growth properties of power-free languages, AVOIDING APPROXIMATE SQUARES, Ostrowski-automatic sequences: theory and applications, Words strongly avoiding fractional powers, WORD COMPLEXITY AND REPETITIONS IN WORDS, On Dejean's conjecture over large alphabets, Lower-bounds on the growth of power-free languages over large alphabets, On balanced sequences and their asymptotic critical exponent, Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters, Thue type problems for graphs, points, and numbers, Efficient computation of maximal anti-exponent in palindrome-free strings, Anti-power prefixes of the Thue-Morse word, On repetition thresholds of caterpillars and trees of bounded degree, Bounds for the generalized repetition threshold, Last cases of Dejean's conjecture, Avoiding large squares in partial words, Pattern avoidance: themes and variations, The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$, On the number of \(\alpha \)-power-free binary words for \(2<\alpha \leq 7/3\), Dejean's conjecture holds for \(n\geq 30\), Repetition avoidance in products of factors, On the growth rates of complexity of threshold languages, Growth rates of complexity of power-free languages, Square-Free Partial Words with Many Wildcards, On a word avoiding near repeats, On factor graphs of DOL words, On combinatorial properties of the Arshon sequence, On maximal repetitions of arbitrary exponent, On the D0L Repetition Threshold, Every real number greater than 1 is a critical exponent, Nonrepetitive list colorings of the integers, The repetition threshold for binary rich words, A generalization of Thue freeness for partial words, WORDS AVOIDING $\frac{7}{3}$-POWERS AND THE THUE–MORSE MORPHISM, Ternary Square-Free Partial Words with Many Wildcards, ON THE REPETITIVITY INDEX OF INFINITE WORDS, Dejean's conjecture and letter frequency, Dejean's conjecture and letter frequency, Anti-power $j$-fixes of the Thue-Morse word, Dejean's conjecture holds for N ≥ 27, ON PANSIOT WORDS AVOIDING 3-REPETITIONS, On cube-free \(\omega\)-words generated by binary morphisms, Subword complexity and power avoidance, On repetition-free binary words of minimal density, Uniformly growing k-th power-free homomorphisms, A generator of morphisms for infinite words, A propos d'une conjecture de F. Dejean sur les répétitions dans les mots, A generalization of repetition threshold, Abelian repetition threshold revisited, On balanced sequences and their critical exponent, The weak circular repetition threshold over large alphabets, Asymptotic repetitive threshold of balanced sequences, Rich square-free words
Cites Work
