Maximal Repetitions in Words or How to Find all Squares in Linear Time
Roman Maksimovich Kolpakov, Grégory Kucherov · 1998
A (fractional) repetition in a word w is a subword with the period of at most half of the subword length. We study maximal repetitions occurring in w, that is those for which any extended subword of w has a bigger period. The set of such repetitions represents in a compact way all repetitions in w. We first count the exact number of maximal repetitions in Fibonacci words. Then we prove our main result asserting that the maximal number of such repetitions in general words (on arbitrary alphabet) is linear in the word length. We then show how this result implies a lineartime algorithm for finding all maximal repetitions.