A. Apostolico and A. Ehrenfeucht, Efficient detection of quasiperiodicities in strings, Theor. Comput. Sci, vol.119, issue.2, pp.247-265, 1993.

A. A. Brudno, Entropy and complexity of the trajectories of a dynamical system, Tr. Mosk. Mat. O.-va, vol.44, pp.124-149, 1982.

J. Cassaigne, Subword complexity and periodicity in two or more dimensions, Developments in Language Theory, Foundations, Applications, and Perspectives, pp.14-21, 1999.

M. Crochemore, C. S. Iliopoulos, and M. Korda, Two-dimensional prefix string matching and covering on square matrices, Algorithmica, vol.20, issue.4, pp.353-373, 1998.
URL : https://hal.archives-ouvertes.fr/hal-00619570

A. Glen, F. Levé, and G. Richomme, Quasiperiodic and lyndon episturmian words, Theor. Comput. Sci, vol.409, issue.3, pp.578-600, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00599745

C. S. Iliopoulos and L. Mouchard, Quasiperiodicity: From detection to normal forms, Journal of Automata, Languages and Combinatorics, vol.4, issue.3, pp.213-228, 1999.

F. Levé and G. Richomme, Quasiperiodic infinite words: Some answers (column: Formal language theory), Bulletin of the EATCS, vol.84, pp.128-138, 2004.

F. Levé and G. Richomme, Quasiperiodic sturmian words and morphisms, Theor. Comput. Sci, vol.372, issue.1, pp.15-25, 2007.

M. Lothaire, Combinatorics on Words. Cambridge Mathematical Library, 1997.
URL : https://hal.archives-ouvertes.fr/hal-00620609

S. Marcus, Quasiperiodic infinite words (columns: Formal language theory), Bulletin of the EATCS, vol.82, pp.170-174, 2004.

T. Monteil and S. Marcus, Quasiperiodic infinite words: multi-scale case and dynamical properties

R. Polley and L. Staiger, The maximal subword complexity of quasiperiodic infinite words, Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, DCFS 2010, vol.31, pp.169-176, 2010.

E. Schechter, Handbook of Analysis and Its Foundations, 1996.