On maximal repetitions of arbitrary exponent

DOI10.1016/j.ipl.2010.01.005zbMath1209.68300arXiv0906.4750OpenAlexW2063371253WikidataQ58064500 ScholiaQ58064500MaRDI QIDQ991771

Gregory Kucherov, Pascal Ochem, Roman M. Kolpakov

Publication date: 7 September 2010

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

Full work available at URL: https://arxiv.org/abs/0906.4750

zbMATH Keywords

combinatorial problemstheory of computationrepetitionsperiodicities

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Upper bounds on distinct maximal (sub-)repetitions in compressed strings ⋮ Searching of gapped repeats and subrepetitions in a word ⋮ Computing maximal-exponent factors in an overlap-free word ⋮ Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings ⋮ Optimal bounds for computing \({\alpha}\)-gapped repeats ⋮ Some results on the number of periodic factors in words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polynomial versus exponential growth in repetition-free binary words
• Sur un théorème de Thue
• Towards a Solution to the “Runs” Conjecture

This page was built for publication: On maximal repetitions of arbitrary exponent