|
|||||
|
|
On maximal repetitions of arbitrary exponent |
|
| Authors: | Roman Kolpakov Pascal Ochem |
| Affiliation: | a Moscow University, Russian Federation b LIFL and INRIA Lille - Nord Europe, Lille, France c LRI, Orsay, France d J.-V. Poncelet Lab., Moscow, Russian Federation |
| Abstract: | The first two authors have shown [1,2] (Kolpakov and Kucherov, 1999, 2000) that the sum of the exponents (and thus the number) of maximal repetitions of exponent at least 2 in a word (also called runs) is linear with respect to the length of the word. The exponent 2 in the definition of a run may seem arbitrary. In this paper, we consider maximal repetitions of exponent strictly greater than 1. |
| Keywords: | Theory of computation Combinatorial problems Repetitions Periodicities |
| 本文献已被 ScienceDirect 等数据库收录！ | |