J. Allouche and J. Shallit, The ring of k-regular sequences, Theoretical Computer Science, vol.98, issue.2, pp.163-197, 1992.
DOI : 10.1016/0304-3975(92)90001-V

J. Allouche and J. Shallit, The ring of k-regular sequences, II, Theoretical Computer Science, vol.307, issue.1, pp.3-29, 2003.
DOI : 10.1016/S0304-3975(03)00090-2

J. Allouche and J. Shallit, Automatic sequences. Theory, applications, generalizations, 2003.
DOI : 10.1017/cbo9780511546563

J. Berstel and C. Reutenauer, Noncommutative rational series with applications , Encyclopedia of Mathematics and its Applications, 2011.

F. Blanchet-sadri, J. D. Currie, N. Rampersad, and N. Fox, Abelian complexity of fixed point of, INTE- GERS, vol.2, issue.14, p.11, 2014.

A. Carpi and D. Valerio, On factors of synchronized sequences, Theoretical Computer Science, vol.411, issue.44-46, pp.3932-3937, 2010.
DOI : 10.1016/j.tcs.2010.08.005

E. Charlier, N. Rampersad, and J. Shallit, ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES, International Journal of Foundations of Computer Science, vol.23, issue.05, pp.1035-1066, 2012.
DOI : 10.1142/S0129054112400448

A. Cobham, Uniform tag sequences, Mathematical Systems Theory, vol.5, issue.1-2, pp.186-192, 1972.
DOI : 10.1007/BF01706087

A. Frid, On uniform DOL words, STACS'98, pp.1373-544, 1998.
DOI : 10.1007/BFb0028589

F. Greinecker, On the 2-abelian complexity of Thue?Morse subwords

J. Karhumäki, Generalized Parikh mappings and homomorphisms, Information and Control, vol.47, issue.3, pp.155-165, 1980.
DOI : 10.1016/S0019-9958(80)90493-3

J. Karhumäki, A. Saarela, and L. Q. Zamboni, On a generalization of Abelian equivalence and complexity of infinite words, Journal of Combinatorial Theory, Series A, vol.120, issue.8, pp.2189-2206, 2013.
DOI : 10.1016/j.jcta.2013.08.008

J. Karhumäki, A. Saarela, and L. Q. Zamboni, Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence, Lecture Notes in Computer Science, vol.8633, pp.203-214, 2014.
DOI : 10.1007/978-3-319-09698-8_18

B. Madill and N. Rampersad, The abelian complexity of the paperfolding word, Discrete Math, pp.831-838, 2013.

O. The and . Foundation, The On-Line Encyclopedia of Integer Sequences

M. Rigo and . Vandomme, 2-abelian complexity of the Thue?Morse sequence, 2012.