On the Repetition Threshold for Large Alphabets

DOI10.1007/11821069_20zbMath1132.68515OpenAlexW1560097011MaRDI QIDQ5756719

Arturo Carpi

Publication date: 5 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11821069_20

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (5)

Letter frequency in infinite repetition-free words ⋮ On Dejean's conjecture over large alphabets ⋮ On the D0L Repetition Threshold ⋮ Every real number greater than 1 is a critical exponent ⋮ Dejean's conjecture and letter frequency

This page was built for publication: On the Repetition Threshold for Large Alphabets