Linear-Time Computation of Local Periods - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2004

Linear-Time Computation of Local Periods

Roman Kolpakov
  • Function : Author
Thierry Lecroq
Arnaud Lefebvre


We present a linear-time algorithm for computing {\em all} local periods of a given word. This subsumes (but is substantially more powerful than) the computation of the (global) period of the word and on the other hand, the computation of a critical factorization, implied by the Critical Factorization Theorem.

Dates and versions

inria-00100127 , version 1 (26-09-2006)



Jean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre. Linear-Time Computation of Local Periods. Theoretical Computer Science, 2004, 326 (1-3), pp.229-240. ⟨10.1016/j.tcs.2004.06.024⟩. ⟨inria-00100127⟩
71 View
0 Download



Gmail Facebook X LinkedIn More