On a word avoiding near repeats

DOI10.1016/J.IPL.2009.02.022zbMATH Open1209.68349OpenAlexW1965142096MaRDI QIDQ989452FDOQ989452

Authors: Arturo Carpi, Valerio D'Alonzo 

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

Recommendations

• Words without Near-Repetitions
• Fewest repetitions in infinite binary words
• Infinite words containing the minimal number of repetitions
• MUTUALLY AVOIDING TERNARY WORDS OF SMALL EXPONENT
• On highly repetitive and power free words

zbMATH Keywords

combinatorial problemsrepetitionfractional exponentrepetitivity index

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Cites Work

• A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Dejean's conjecture and Sturmian words
• Title not available (Why is that?)
• Arithmetic and analytic properties of paper folding sequences

Cited In (7)

• A word on 7 letters which is non-repetitive up to mod 5
• Avoiding approximate repetitions with respect to the longest common subsequence distance
• Non-repetitive words: Ages and essences
• Automata and differentiable words
• Binary words avoiding xx^Rx and strongly unimodal sequences
• Words without Near-Repetitions
• On weakly self-avoiding words

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

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