1. 1. THUE A., Uber Die Gegenseitige Lage Gleicher Teile Gewisser Zeichenreichen, Skr. Vid.-Kristiana I. Mat. Naturv. Klasse, Vol. 1, 1912, pp. 1-6744.0462.01
2. 2. MAIN M. and LORENTZ R., An O (n log n) Algorithm for Finding Repetition in a String. T.R. 79-056, Comp. Sc. Dept., Washington State Univ., Pullman, 1972.
3. 3. CROCHEMORE M., An Optimal Algorithm for Computing the Repetitions in a Word, Information Processing Letters, Vol. 12, 1981, pp. 244-250.6328730467.68075
4. 4. APOSTOLICO A. and PREPARATA F. P., Optimal Off-Line Detection of Repetitions in a String, Theoretical Computer Science, Vol. 22, 1983, pp. 237-315.6930620497.68052
5. 5. LENTIN A. and SCHUTZEMBERGER M. P., A Combinatorial Problem in the Theory of Free Monoids, in Combinatorial Mathematics and its Applications, University of North Carolina Press, N.C., 1969, pp. 128-144.0221.20076