Finite repetition threshold for large alphabets

DOI10.1051/ITA/2014017MaRDI QIDQ2934276zbMATH OpenOpenAlexWikidataFDO

Authors Golnaz Badkobeh, Maxime Crochemore, Michaël Rao

Publication date 12 December 2014

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://kclpure.kcl.ac.uk/portal/en/publications/finite-repetition-threshold-for-large-alphabets(5a01c6ee-f999-463f-b5fd-fd406f4dd53c).html

zbMATH Keywords

Dejean's thresholdmorphismsrepetitions in words

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• On the Repetition Threshold for Large Alphabets
• A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
• Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
• Repetition thresholds for subdivided graphs and trees
• Finite-repetition threshold for infinite ternary words

Cited in

(13)

• Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
• Abelian repetition threshold revisited
• Letter frequency in infinite repetition-free words
• Avoiding letter patterns in ternary square-free words
• Finite-repetition threshold for infinite ternary words
• On two stronger versions of Dejean's conjecture
• scientific article; zbMATH DE number 4024387 (Why is no real title available?)
• Avoiding or limiting regularities in words
• The weak circular repetition threshold over large alphabets
• On the Repetition Threshold for Large Alphabets
• On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
• A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
• Computing maximal-exponent factors in an overlap-free word

This page was built for publication: Finite repetition threshold for large alphabets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934276)