On a word avoiding near repeats

DOI10.1016/J.IPL.2009.02.022zbMath1209.68349OpenAlexW1965142096MaRDI QIDQ989452

Valerio D'Alonzo, Arturo Carpi

Publication date: 20 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.02.022

zbMATH Keywords

combinatorial problemsrepetitionfractional exponentrepetitivity index

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Related Items (1)

Automata and differentiable words

Cites Work

• A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
• Dejean's conjecture and Sturmian words
• Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
• On Dejean's conjecture over large alphabets
• Sur un théorème de Thue
• A generalization of repetition threshold
• Arithmetic and analytic properties of paper folding sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a word avoiding near repeats