]. A. Blondin-massé, S. Gaboury, and S. Hallé, Pseudoperiodic Words, DLT'2012 - 16th International Conference on Developments in Language Theory, pp.14-17, 2012.
DOI : 10.1007/978-3-642-31653-1_28

A. Blondin-massé, G. Paquin, and L. Vuillon, A Fine and Wilf's theorem for pseudoperiods and Justin's formula for generalized pseudostandard words, in JM'2010 -13th Mons Theoretical Computer Science Days, 2010.

A. B. Massé and L. Vuillon, Generalized pseudostandard words having complexity 2n, LaCIM'2010 -20th Anniversary of the Laboratoire de combinatoire et d'informatique mathématique, 2010.

M. Bucci, A. De-luca, A. De-luca, and L. Q. Zamboni, On different generalizations of episturmian words, Theoretical Computer Science, vol.393, issue.1-3, pp.23-36, 2008.
DOI : 10.1016/j.tcs.2007.10.043

M. Bucci, A. De-luca, A. De-luca, and L. Q. Zamboni, On some problems related to palindromic closure, RAIRO-Theor, Inf. and Appl, pp.42-679, 2008.

E. Czeizler, E. Czeizler, L. Kari, and S. Seki, An extension of the Lyndon Schützenberger result to pseudoperiodic words, DLT '09: Proceedings of the 13th International Conference on Developments in Language Theory, pp.183-194, 2009.

A. De-luca, Sturmian words: structure, combinatorics, and their arithmetics, Theoretical Computer Science, vol.183, issue.1, pp.45-82, 1997.
DOI : 10.1016/S0304-3975(96)00310-6

A. De-luca and A. De-luca, Pseudopalindrome closure operators in free monoids, Theor. Comput. Sci, vol.362, pp.45-82, 2006.

X. Droubay, J. Justin, and G. Pirillo, Episturmian words and some constructions of de Luca and Rauzy, Theoretical Computer Science, vol.255, issue.1-2, pp.539-553, 2001.
DOI : 10.1016/S0304-3975(99)00320-5

A. Glen and J. Justin, Episturmian words: a survey, RAIRO Theor, Info. Appl, vol.43, pp.402-433, 2009.

D. Jamet, G. Paquin, G. Richomme, and L. Vuillon, On the fixed points of the iterated pseudopalindromic closure operator, WORDS'09 -7th International Conference on Words, 2010.
DOI : 10.1016/j.tcs.2010.03.018
URL : https://hal.archives-ouvertes.fr/hal-00391429

J. Justin, Episturmian morphisms and a Galois theorem on continued fractions, RAIRO - Theoretical Informatics and Applications, vol.39, issue.1, pp.207-215, 2005.
DOI : 10.1051/ita:2005012

F. Manea, R. Merca¸smerca¸s, and D. Nowotka, Fine and Wilf???s Theorem and Pseudo-repetitions, MFCS Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol.2012, issue.7464, pp.668-680, 2012.
DOI : 10.1007/978-3-642-32589-2_58

G. Rote, Sequences With Subword Complexity 2n, Journal of Number Theory, vol.46, issue.2, pp.196-213, 1994.
DOI : 10.1006/jnth.1994.1012

W. A. Stein, The Sage Development Team, Sage Mathematics Software, 2010.