S. Alstrup and J. Holm, Improved Algorithms for Finding Level Ancestors in Dynamic Trees, Proc. ICALP. Lecture Notes in Computer Science, 1853, pp.73-84, 2000.
DOI : 10.1007/3-540-45022-X_8

G. Badkobeh, H. Bannai, K. Goto, I. Tomohiro, C. S. Iliopoulos et al., Closed factorization, Discrete Applied Mathematics, vol.212
DOI : 10.1016/j.dam.2016.04.009
URL : https://kclpure.kcl.ac.uk/portal/en/publications/closed-factorization(d0a6baac-69c9-4e9e-8c1e-111b20b60ae1).html

G. Badkobeh, G. Fici, and Z. Lipták, A Note on Words With the Smallest Number of Closed Factors, p.6395, 2013.

D. Breslauer, An on-line string superprimitivity test, Information Processing Letters, vol.44, issue.6, pp.345-347, 1992.
DOI : 10.1016/0020-0190(92)90111-8

M. Bucci, A. De-luca, and A. De-luca, Rich and Periodic-Like Words, 13th International Conference on Developments in Language Theory of Lecture Notes in Comput. Sci, pp.145-155, 2009.
DOI : 10.1016/j.tcs.2006.07.009

A. Carpi and A. De-luca, Periodic-like words, periodicity, and boxes, Acta Informatica, vol.37, issue.8, pp.597-618, 2001.
DOI : 10.1007/PL00013314

M. Crochemore and L. Ilie, Computing Longest Previous Factor in linear time and applications, Information Processing Letters, vol.106, issue.2, pp.75-80, 2008.
DOI : 10.1016/j.ipl.2007.10.006
URL : https://hal.archives-ouvertes.fr/hal-00619691

M. Crochemore, L. Ilie, C. S. Iliopoulos, M. Kubica, W. Rytter et al., Computing the Longest Previous Factor, European Journal of Combinatorics, vol.34, issue.1, pp.15-26, 2013.
DOI : 10.1016/j.ejc.2012.07.011
URL : https://hal.archives-ouvertes.fr/hal-00837008

G. Fici, A Classification of Trapezoidal Words, WORDS 2011. 8th International Conference on Words, no. 63 in Electronic Proceedings in Theoretical Computer Science, pp.129-137, 2011.
DOI : 10.4204/EPTCS.63.18

A. Glen, J. Justin, S. Widmer, and L. Q. Zamboni, Palindromic richness, European Journal of Combinatorics, vol.30, issue.2, pp.510-531, 2009.
DOI : 10.1016/j.ejc.2008.04.006
URL : https://hal.archives-ouvertes.fr/hal-00865934

Q. Guo, H. Zhang, and C. S. Iliopoulos, Computing the ??-covers of a string, Information Sciences, vol.177, issue.19, pp.3957-3967, 2007.
DOI : 10.1016/j.ins.2007.02.020

C. S. Iliopoulos, M. Mohamed, and W. F. Smyth, New complexity results for the k-covers problem, Information Sciences, vol.181, issue.12, pp.2571-2575, 2011.
DOI : 10.1016/j.ins.2011.02.009

C. S. Iliopoulos and L. Mouchard, An O(n log n) Algorithm for Computing All Maximal Quasiperiodicities in Strings, Theoratical Computer Science, vol.119, pp.247-265, 1993.
URL : https://hal.archives-ouvertes.fr/hal-00465077

C. S. Iliopoulos and W. F. Smyth, On-Line Algorithms for k-Covering, Proc. Ninth Australasian Workshop on Combinatorial Algorithms, pp.107-116, 1998.

J. Kärkkäinen and P. Sanders, Simpler Linear Work Suffix Array Construction, International Colloquium on Automata, Languages and Programming, pp.943-955, 2003.

D. K. Kim, J. S. Sim, H. Park, and K. Park, Linear-Time Construction of Suffix Arrays, 14th Annual Symposium, Combinatorial Pattern Matching, pp.186-199, 2003.
DOI : 10.1007/3-540-44888-8_14

P. Ko and S. Aluru, Space efficient linear time construction of suffix arrays, Journal of Discrete Algorithms, vol.3, issue.2-4, pp.143-156, 2005.
DOI : 10.1016/j.jda.2004.08.002

Y. Li and W. F. Smyth, Computing the Cover Array in Linear Time, Algorithmica, vol.32, issue.1, pp.95-106, 2002.
DOI : 10.1007/s00453-001-0062-2

M. G. Main and R. J. Lorentz, An O(n log n) algorithm for finding all repetitions in a string, Journal of Algorithms, vol.5, issue.3, pp.422-432, 1984.
DOI : 10.1016/0196-6774(84)90021-X

U. Manber and G. Myers, Suffix Arrays: A New Method for On-Line Search, In : SIAM J. on Computing, pp.935-948, 1993.

D. Moore and W. F. Smyth, An optimal algorithm to compute all the covers of a string, Information Processing Letters, vol.50, issue.5, pp.239-246, 1994.
DOI : 10.1016/0020-0190(94)00045-X

A. Thue, ¨ Uber Unendliche Zeichenreihen. Norske Vid, Selsk. Skr. I, Mat. Nat. Kl. Christiana, vol.7, pp.1-22, 1906.

I. Tomohiro, S. Sugimoto, S. Inenaga, H. Bannai, and M. Takeda, Computing Palindromic Factorizations and Palindromic Covers On-line, 2014.