V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, 1974.

I. Akhavi, S. Klimann, J. Lombardy, M. Mairesse, and . Picantin, ON THE FINITENESS PROBLEM FOR AUTOMATON (SEMI)GROUPS, International Journal of Algebra and Computation, vol.22, issue.06, p.26, 2012.
DOI : 10.1142/S021819671250052X
URL : https://hal.archives-ouvertes.fr/hal-00695445

V. Ale?in, Finite automata and the Burnside problem for periodic groups, Mat. Zametki, vol.11, pp.319-328, 1972.

S. Antonenko, On transition functions of Mealy automata of finite growth, Matematychni Studii, vol.29, issue.1, pp.3-17, 2008.

. Bartholdi, FR Functionally recursive groups ? a GAP package, 2011.

I. I. Bartholdi and V. I. Reznykov, The smallest Mealy automaton of intermediate growth, Journal of Algebra, vol.295, issue.2, pp.387-414, 2006.
DOI : 10.1016/j.jalgebra.2004.08.040

R. I. Bondarenko, R. Grigorchuk, Y. Kravchenko, V. Muntyan, D. Nekrashevych et al., On classification of groups generated by 3-state automata over a 2-letter alphabet, Algebra Discrete Math, vol.1, pp.1-163, 2008.

V. Bondarenko, N. V. Bondarenko, S. N. Sidki, and F. R. Zapata, On the conjugacy problem for finite-state automorphisms of regular rooted trees. Groups, Geometry, and Dynamics, in press

J. Cain, Automaton semigroups, GAP ? Groups, Algorithms, and Programming, pp.5022-5038, 2008.
DOI : 10.1016/j.tcs.2009.07.054

S. Glasner and . Mozes, Automata and Square Complexes, Geometriae Dedicata, vol.100, issue.1, pp.43-49, 2005.
DOI : 10.1007/s10711-004-1815-2

A. Grigorchuk and . ?uk, The lamplighter group as a group generated by a 2-state automaton, and its spectrum, Geometriae Dedicata, vol.87, issue.1/3, pp.209-244, 2001.
DOI : 10.1023/A:1012061801279

I. Grigorchuk, On Burnside's problem on periodic groups, Funktsional. Anal. i Prilozhen, vol.14, issue.1, pp.53-54, 1980.

I. Grigorchuk, V. V. Nekrashevich, and V. I. , Sushchanski? ?. Automata, dynamical systems, and groups, Tr. Mat. Inst. Steklova, vol.231, pp.134-214, 2000.

J. Klimann, M. Mairesse, and . Picantin, Implementing Computations in Automaton (Semi)groups, Proc. 17th CIAA, pp.240-252, 1142.
DOI : 10.1007/978-3-642-31606-7_21

. Maltcev, CAYLEY AUTOMATON SEMIGROUPS, International Journal of Algebra and Computation, vol.19, issue.01, pp.79-95, 2009.
DOI : 10.1142/S021819670900497X

. Mintz, ON THE CAYLEY SEMIGROUP OF A FINITE APERIODIC SEMIGROUP, International Journal of Algebra and Computation, vol.19, issue.06, pp.723-746, 2009.
DOI : 10.1142/S0218196709005378

D. Muntyan and . Savchuk, automgrp Automata Groups ? a GAP package, 2008.

. Nekrashevych, Self-similar groups, volume 117 of Mathematical Surveys and Monographs, 2005.

M. Savchuk and Y. Vorobets, Automata generating free products of groups of order 2, Journal of Algebra, vol.336, issue.1, pp.53-66, 2011.
DOI : 10.1016/j.jalgebra.2011.02.049

N. Sidki, Automorphisms of one-rooted trees: Growth, circuit structure, and acyclicity, Journal of Mathematical Sciences, vol.68, issue.No. 2, pp.1925-1943, 2000.
DOI : 10.1007/BF02677504

V. Silva and B. Steinberg, ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS, International Journal of Algebra and Computation, vol.15, issue.05n06, pp.5-61213, 2005.
DOI : 10.1142/S0218196705002761

M. Steinberg, Y. Vorobets, and . Vorobets, AUTOMATA OVER A BINARY ALPHABET GENERATING FREE GROUPS OF EVEN RANK, International Journal of Algebra and Computation, vol.21, issue.01n02, pp.329-354, 2011.
DOI : 10.1142/S0218196711006194