The following pages link to Sur un théorème de Thue (Q2555163):
Displaying 50 items.
- Infinite words containing the minimal number of repetitions (Q396642) (← links)
- Minimal critical exponent of quasiperiodic words (Q401485) (← links)
- Avoiding 3/2-powers over the natural numbers (Q409482) (← links)
- Growth properties of power-free languages (Q465700) (← links)
- Efficient computation of maximal anti-exponent in palindrome-free strings (Q507406) (← links)
- Anti-power prefixes of the Thue-Morse word (Q510349) (← links)
- Bounds for the generalized repetition threshold (Q544880) (← links)
- Last cases of Dejean's conjecture (Q544887) (← links)
- Avoiding large squares in partial words (Q551207) (← links)
- Pattern avoidance: themes and variations (Q557911) (← links)
- Polynomial versus exponential growth in repetition-free binary words (Q598459) (← links)
- Growth of power-free languages: numerical and asymptotic bounds (Q610578) (← links)
- On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters (Q650879) (← links)
- Fewest repetitions versus maximal-exponent powers in infinite binary words (Q650894) (← links)
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots (Q792102) (← links)
- Branching frequency and Markov entropy of repetition-free languages (Q832956) (← links)
- Dejean's conjecture and Sturmian words (Q872047) (← links)
- Computing maximal-exponent factors in an overlap-free word (Q899581) (← links)
- Cancellation in semigroups in which \(x^ 2=x^ 3\) (Q909798) (← links)
- Thue type problems for graphs, points, and numbers (Q941381) (← links)
- Growth rates of complexity of power-free languages (Q986556) (← links)
- On a word avoiding near repeats (Q989452) (← links)
- On maximal repetitions of arbitrary exponent (Q991771) (← links)
- Every real number greater than 1 is a critical exponent (Q995572) (← links)
- A generalization of Thue freeness for partial words (Q1006051) (← links)
- Repetition-free words (Q1078338) (← links)
- Multidimensional unrepetitive configurations (Q1106022) (← links)
- Mots sans carre et morphismes iterés (Q1144665) (← links)
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters (Q1184978) (← links)
- On repetition-free binary words of minimal density (Q1292490) (← links)
- On repeated factors in \(C^\infty\)-words (Q1342256) (← links)
- The set of \(k\)-power free words over \(\Sigma\) is empty or perfect (Q1399694) (← links)
- Growth of power-free languages over large alphabets (Q1678750) (← links)
- On repetition thresholds of caterpillars and trees of bounded degree (Q1753030) (← links)
- On cube-free \(\omega\)-words generated by binary morphisms (Q1835915) (← links)
- Uniformly growing k-th power-free homomorphisms (Q1838047) (← links)
- On the structure and extendibility of \(k\)-power free words (Q1891362) (← links)
- Non-repetitive words: Ages and essences (Q1912750) (← links)
- Words strongly avoiding fractional powers (Q1970068) (← links)
- Nonrepetitive list colorings of the integers (Q2033476) (← links)
- Abelian repetition threshold revisited (Q2097234) (← links)
- On balanced sequences and their critical exponent (Q2098168) (← links)
- Fractional meanings of nonrepetitiveness (Q2120819) (← links)
- The critical exponent functions (Q2131735) (← links)
- On non-repetitive sequences of arithmetic progressions: the cases \(k\in\{4,5,6,7,8\}\) (Q2181220) (← links)
- Avoiding 5/4-powers on the alphabet of nonnegative integers (Q2194095) (← links)
- Avoidance of split overlaps (Q2214038) (← links)
- Extremal overlap-free and extremal \(\beta\)-free binary words (Q2215463) (← links)
- Ostrowski-automatic sequences: theory and applications (Q2222098) (← links)
- Lower-bounds on the growth of power-free languages over large alphabets (Q2230725) (← links)
