Linear-Time Computation of Local Periods - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2003

Linear-Time Computation of Local Periods


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.
No file

Dates and versions

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


  • HAL Id : inria-00099598 , version 1


Jean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre. Linear-Time Computation of Local Periods. 28nd International Symposium on Mathematical Foundations of Computer Science - MFCS'03, Aug 2003, Bratislava, Slovakia, pp.388-397. ⟨inria-00099598⟩
171 View
0 Download


Gmail Facebook Twitter LinkedIn More