. Sont-pas-isomorphes, Clairement Sch (x ? ) admet une boucle étiquetée par q sur le sommet x ?

. Dans-le-théorème-précédent, on voit que x ? est un point singulier de AA. Il est facile de voir que le théorème reste valide en remplaçant x ? ? par s ? ? *

?. Pour-x and . {0, 2}, on considère le graphe? x obtenu à partir de Sch (x ? ) comme suit : 1. soient deux copies de Sch (x ? ) avec g x ? {a, b, c} l'étiquette de la boucle sur x ?

. Alors-la-suite, Sch (? n )) n de graphes de Schreier du groupe des tours de Hanoï H (3) converge vers ? x quand n ? ?. Proposition 3

A. Akhavi, ON THE FINITENESS PROBLEM FOR AUTOMATON (SEMI)GROUPS, International Journal of Algebra and Computation, vol.182, issue.06, pp.1-26, 2012.
DOI : 10.1016/j.jalgebra.2012.04.014
URL : https://hal.archives-ouvertes.fr/hal-00695445

S. V. Ale?in, Finite automata and the Burnside problem for periodic groups, Akademiya Nauk SSSR. Matematicheskie Zametki, vol.11, pp.319-328, 1972.

A. S. Antonenko, On transition functions of Mealy automata of finite growth, In : Matematychni Studii, vol.291, issue.32, pp.3-17, 2008.

L. Bartholdi, Algorithmic Decidability of Engel???s Property for Automaton Groups
DOI : 10.1007/978-3-642-88599-0

L. Bartholdi, . Fr, and . Gap, Computations with functionally recursive groups

L. Bartholdi, LOWER BOUNDS ON THE GROWTH OF A GROUP ACTING ON THE BINARY ROOTED TREE, International Journal of Algebra and Computation, vol.105, issue.2, pp.73-88, 2001.
DOI : 10.1016/0021-8693(72)90058-0

L. Bartholdi, The growth of Grigorchuk s torsion group, In : Internat. Math. Res. Notices, pp.1049-1054, 1998.

L. Bartholdi, I. I. Reznykov, and V. I. Sushchansky, 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

L. Bartholdi and Z. ?uni?, ON THE WORD AND PERIOD GROWTH OF SOME GROUPS OF TREE AUTOMORPHISMS, Communications in Algebra 29-11, pp.4923-4964, 2001.
DOI : 10.1081/AGB-100106794

F. Bassino, C. Nicaud, and P. Weil, Generic properties of subgroups of free groups and finite presentations, Contemporary Mathematics, vol.677, pp.1-44, 2016.
DOI : 10.1090/conm/677/13619
URL : https://hal.archives-ouvertes.fr/hal-01171484

F. Bassino, C. Nicaud, and P. Weil, RANDOM GENERATION OF FINITELY GENERATED SUBGROUPS OF A FREE GROUP, International Journal of Algebra and Computation, vol.196, issue.02, pp.375-405, 2008.
DOI : 10.1007/978-1-4612-1388-8_16
URL : https://hal.archives-ouvertes.fr/hal-00164584

F. Bassino, C. Nicaud, and P. Weil, Abstract, Journal of Group Theory, vol.19, issue.1, pp.137-159, 2016.
DOI : 10.1515/jgth-2015-0030

F. Bassino, Statistical properties of subgroups of free groups, Random Structures & Algorithms, vol.16, issue.3, pp.349-373, 2013.
DOI : 10.1007/978-1-4612-1388-8_16
URL : https://hal.archives-ouvertes.fr/hal-00450218

V. V. Belyaev, N. F. Sesekin, and V. I. Trofimov, Growth functions of semigroups and loops, In : Ural. Gos. Univ. Mat. Zap, vol.10, pp.3-8, 1977.

M. V. Berlinkov, On the Probability of Being Synchronizable, Algorithms and Discrete Applied Mathematics -Second International Conference, pp.73-84, 2016.
DOI : 10.1007/978-3-540-88282-4_4

S. R. Blackburn, J. R. Britnell, and . Wildon, The probability that a pair of elements of a finite group are conjugate, Journal of the London Mathematical Society, vol.86, issue.3, pp.755-778, 2012.
DOI : 10.1112/jlms/jds022

I. V. Bondarenko and R. V. Kravchenko, Finite-state self-similar actions of nilpotent groups, Geometriae Dedicata, vol.336, issue.1, pp.339-348, 2013.
DOI : 10.1016/j.jalgebra.2011.02.049

I. V. Bondarenko, On the conjugacy problem for finite-state automorphisms of regular rooted trees, In : Groups Geom. Dyn, vol.7, issue.2, 2013.

I. Bondarenko, D. D-'angeli-et, and T. Nagnibeda, Ends of Schreier graphs and cutpoints of limit spaces of self-similar groups

I. Bondarenko, D. D-'angeli-et, and E. Rodaro, The lamplighter group Z 3 Z generated by a bireversible automaton, Communications in Algebra

I. Bondarenko, Groups generated by 3-state automata over a 2-letter alphabet. II, Journal of Mathematical Sciences, vol.311, issue.6, pp.187-208, 2009.
DOI : 10.1090/surv/117
URL : http://arxiv.org/pdf/math/0612178v1.pdf

T. Brough and A. J. Cain, Automaton semigroups: New constructions results and examples of non-automaton semigroups, Theoretical Computer Science, vol.674
DOI : 10.1016/j.tcs.2017.02.003

W. Burnside, On an unsettled question in the theory of discontinuous groups, In : Quart. J. Math, vol.33, issue.46, pp.230-238, 1902.

K. Bux, Selfsimilar groups and conformal dynamics Problem List (cf, p.46

A. J. Cain, Automaton semigroups, Theoretical Computer Science, vol.410, issue.47-49, pp.5022-5038, 2009.
DOI : 10.1016/j.tcs.2009.07.054
URL : https://doi.org/10.1016/j.tcs.2009.07.054

L. Caponi, On the classification of groups generated by automata with 4 states over a 2-letter alphabet, Thèse de doct, pp.2014-2035

D. D. Angeli and E. Rodaro, A geometric approach to (semi)-groups defined by automata via dual transducers, Geometriae Dedicata, vol.174, issue.66, pp.375-400, 2015.

D. D. Angeli, Boundary action of automaton groups without critical points and Wang tilings " . (in preparation) (cf, pp.5-115

D. Felice and C. Nicaud, Random Generation of Deterministic Acyclic Automata Using the Recursive Method, pp.88-99, 2013.
DOI : 10.1007/978-3-642-38536-0_8
URL : https://hal.archives-ouvertes.fr/hal-00841835

J. D. Dixon, The probability of generating the symmetric group, Mathematische Zeitschrift, vol.18, issue.3, pp.199-205, 1969.
DOI : 10.1007/BF01110210

P. Erd?s, Graph theory and probability, In : canad. J. Math, vol.1111, pp.34-38, 1959.

P. Erd?s, Some remarks on the theory of graphs, Bulletin of the American Mathematical Society, vol.53, issue.4, pp.292-294
DOI : 10.1090/S0002-9904-1947-08785-1

P. Erd?s and P. Turán, On some problems of a statistical group-theory. III, Acta Mathematica Academiae Scientiarum Hungaricae, vol.18, issue.3-4, pp.309-320, 1967.
DOI : 10.1007/BF02280290

P. Erd?s and P. Turán, On some problems of statistical group theory V, Acta. Math. Acad. Sci. Hungar, vol.1, pp.5-13, 1971.

J. Fabrykowski and N. Gupta, On groups with sub-exponential growth functions, pp.49-52, 1985.

P. Flajolet, A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics, In : Electronic Journal of Combinatorics, vol.131, issue.1, pp.1-35, 2006.

E. Frenkel, A. Nikolaev, and A. Ushakov, Knapsack problems in products of groups, Journal of Symbolic Computation, vol.74
DOI : 10.1016/j.jsc.2015.05.006

R. Frucht, Herstellung von Graphen mit vorgegebener abstrakter Gruppe, German. In : Compos. Math, vol.6, issue.1, pp.239-250, 1938.

G. Groups and P. Algorithms, Version 4.7.7. http ://www.gap-system.org. The GAP Group, p.10, 2015.

P. Gillibert, THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE, International Journal of Algebra and Computation, vol.247, issue.01, pp.1-9, 2014.
DOI : 10.1007/s00222-003-0321-8
URL : https://hal.archives-ouvertes.fr/hal-00809295

Y. Glasner and S. Mozes, Automata and Square Complexes, Geometriae Dedicata, vol.100, issue.1, pp.43-64, 2005.
DOI : 10.1515/9781400882441
URL : http://arxiv.org/pdf/math/0306259

V. M. Glu?kov, Abstract theory of automata, Akademiya Nauk SSSR i Moskovskoe Matematicheskoe Obshchestvo. Uspekhi Matematicheskikh Nauk 16-5, pp.3-62, 1961.

. Th and . Godin, An Analogue to Dixon Theorem for Automaton Groups, ANALCO17 (cf. p. 4, p.136

. Th, I. Godin, and . Klimann, Connected Reversible Mealy Automata of Prime Size Cannot Generate Infinite Burnside Groups, 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, pp.1-44, 2016.

. Th, I. Godin, M. Klimann, and . Picantin, On torsion-free semigroups generated by invertible reversible Mealy automata, Language and automata theory and applications

E. S. Golod, On nil-algebras and finitely residual groups, In : Izv. Akad. Nauk SSSR

E. S. Golod and I. Shafarevich, On class field towers, In : Izv. Akad. Nauk SSSR Ser. Mat, vol.28, pp.261-272, 1964.
DOI : 10.1090/trans2/048/05

R. I. Grigorchuk, DEGREES OF GROWTH OF FINITELY GENERATED GROUPS, AND THE THEORY OF INVARIANT MEANS, Izvestiya Akademii Nauk SSSR. Seriya Matematicheskaya 48-5, pp.939-985, 1984.
DOI : 10.1070/IM1985v025n02ABEH001281

R. I. Grigorchuk, On Burnside's problem on periodic groups " . In : Akademiya Nauk SSSR. Funktsional ny? ? Analiz i ego Prilozheniya, pp.14-15, 1980.

R. I. Grigorchuk, Some topics in the dynamics of group actions on rooted trees, The Proceedings of the Steklov Institute of Math, pp.1-118, 2011.
DOI : 10.1134/S0081543811040067

R. I. Grigorchuk, V. V. Nekrashevich, and V. I. Sushchanski?-i, Automata, dynamical systems, and groups

R. I. Grigorchuk and D. Savchuk, Ergodic decomposition of group actions on rooted trees, Proceedings of the Steklov Institute of Mathematics, pp.94-111, 2016.

R. I. Grigorchuk and D. Savchuk, Self-similar groups acting essentially freely on the boundary of the binary rooted tree, Group theory, combinatorics, and computing
DOI : 10.1090/conm/611/12205

R. I. Grigorchuk and A. ?uk, ON A TORSION-FREE WEAKLY BRANCH GROUP DEFINED BY A THREE STATE AUTOMATON, International Journal of Algebra and Computation, vol.35, issue.4, pp.1-2, 2002.
DOI : 10.7146/math.scand.a-10568

M. Gromov, Groups of polynomial growth and expanding maps, Publications math??matiques de l'IH??S, vol.2, issue.1, pp.53-73, 1981.
DOI : 10.1016/0021-8693(72)90058-0

N. Gupta and S. Sidki, On the Burnside problem for periodic groups, Mathematische Zeitschrift, vol.14, issue.3, pp.385-388, 1983.
DOI : 10.1007/BF01179757

P. De and . Harpe, Topics in Geometric Group Theory, Chicago Lectures in Mathematics, vol.12, p.11, 2000.

E. Jeandel and M. Rao, An aperiodic set of 11 Wang tiles, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01166053

M. Kambites, P. V. Silva, and B. Steinberg, The spectra of lamplighter groups and Cayley machines, Geometriae Dedicata, vol.15, issue.1, pp.193-227, 2006.
DOI : 10.1017/CBO9780511626302

J. Kari, The Nilpotency Problem of One-Dimensional Cellular Automata, SIAM Journal on Computing, vol.21, issue.3, pp.571-586, 1992.
DOI : 10.1137/0221036

M. Kassabov and I. Pak, Groups of oscillating intermediate growth, Annals of Mathematics, vol.177, issue.3, pp.1113-1145, 2013.
DOI : 10.4007/annals.2013.177.3.7
URL : http://www.math.ucla.edu/~pak/papers/Growth27.pdf

I. Klimann, Automaton Semigroups: The Two-state Case, Theor. Comput. Syst. (special issue STACS'13), pp.1-17, 2014.
DOI : 10.4171/GGD/87

I. Klimann, On level-transitivity and exponential growth, Semigroup Forum, vol.75, issue.4, pp.1-7, 2016.
DOI : 10.2307/2313822
URL : https://hal.archives-ouvertes.fr/hal-01323857

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

I. Klimann and M. Picantin, A Characterization of Those Automata That Structurally Generate Finite Groups, Theoretical Informatics -11th Latin American Symposium, pp.180-189, 2014.
DOI : 10.1007/978-3-642-54423-1_16
URL : https://hal.archives-ouvertes.fr/hal-00877087

I. Klimann, M. Picantin, and D. Savchuk, A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group, Developments in Language Theory -19th International Conference, pp.313-325, 2015.
DOI : 10.1007/978-3-319-21500-6_25
URL : http://arxiv.org/pdf/1409.6142

I. Klimann, M. Picantin, and D. Savchuk, Orbit automata as a new tool to attack the order problem in automaton groups, Journal of Algebra, vol.445, issue.70, pp.433-457, 2016.
DOI : 10.1016/j.jalgebra.2015.07.003

D. König, M. Lohrey, and G. Zetzsche, Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups
DOI : 10.1090/conm/677/13625

L. Gloannec, The 4 way deterministic Periodic Domino Problem is undecidable " . https, p.125
URL : https://hal.archives-ouvertes.fr/hal-00985482

M. W. Liebeck and A. Shalev, The probability of generating a finite simple group, Geometriae Dedicata, vol.3, issue.1, pp.103-113, 1995.
DOI : 10.1007/BF01263616

V. Lukkarila, The 4-way deterministic tiling problem is undecidable, Theoretical Computer Science, vol.410, issue.16, pp.1516-1533, 2009.
DOI : 10.1016/j.tcs.2008.12.006
URL : https://doi.org/10.1016/j.tcs.2008.12.006

A. Mann, How Groups Grow Lecture Note Series, p.19, 2011.

V. D. Mazurov and E. I. Khukhro, Unsolved Problems in Group Theory. The Kourovka Notebook

G. Mealy, A method for synthesizing sequential circuits, The Bell System Technical Journal, vol.34, issue.5, pp.1045-1079, 1955.
DOI : 10.1002/j.1538-7305.1955.tb03788.x

J. Milnor, Problem 5603, Amer. Math. Monthly, vol.756, pp.685-686, 1968.

Y. Muntyan and D. Savchuk, AutomGrp ? GAP package for computations in self-similar groups and semigroups, Version 1.2.4

V. Nekrashevych, Self-similar groups. T. 117 Mathematical Surveys and Monographs, pp.231-258, 2005.

E. Netto, Substitutionstheorie und ihre Anwendung auf die Algebra. 1882 (cf, p.128

C. Nicaud, Fast Synchronization of Random Automata, pp.1-43, 2016.

P. S. Novikov and S. I. Adian, Infinite periodic groups. I, II, III, Mathematics of the USSR-Izvestiya, pp.665-712, 1968.
DOI : 10.1070/im1968v002n01abeh000637

Y. Ollivier, invitation to random groups, In : Ensaios Matemáticos, vol.10, p.127, 2005.

D. Perrin and J. Pin, Infinite words : automata, semigroups, logic and games. Pure and applied mathematics, Calif.) : Academic, p.106, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00619830

M. Picantin, Automatic semigroups vs automaton semigroups In : ArXiv e-prints (sept. 2016)

J. Pin, Logic, semigroups and automata on words, Annals of Mathematics and Artificial Intelligence, vol.3, issue.1, pp.343-384, 1996.
DOI : 10.1007/3-540-56503-5_60
URL : http://www.liafa.jussieu.fr/~jep/PostScript/SurveyLogic.ps.gz

A. Russyev, Finite groups as groups of automata with no cycles with exit, Algebra and Discrete Mathematics, vol.91, issue.32, pp.86-102, 2010.

J. Sakarovitch, Elements of Automata Theory, p.73, 2009.
DOI : 10.1017/CBO9781139195218

A. Salomaa, Formal languages ACM monograph series, 1973.

M. Schützenberger, On finite monoids having only trivial subgroups, Information and Control, vol.8, issue.2, pp.190-194, 1965.
DOI : 10.1016/S0019-9958(65)90108-7

M. Schützenberger, Une théorie algébrique du codage In : Séminaire Dubreil- Pisot, année 1955-56. Exposé No. 15, 27 février 1956, 24 pages, Paris : Inst. H. Poincaré, issue.1, 1956.

W. R. Scott, Group Theory, p.138, 1964.
DOI : 10.1002/9781119951438.eibd0353

A. Shalev, Random Generation of Simple Groups by Two Conjugate Elements, Bulletin of the London Mathematical Society, vol.29, issue.5, pp.571-576, 1997.
DOI : 10.1112/S002460939700338X

S. Sidki, Automorphisms of one-rooted trees: Growth, circuit structure, and acyclicity, Journal of Mathematical Sciences, vol.68, issue.No. 2
DOI : 10.4213/mzm1821

N. J. Sloane, The On-Line Encyclopedia of Integer Sequences. published electronically at (cf, p.141

L. Staiger, Entropy of finite-state omega-languages In : Problems of Control and Information Theory 14, pp.383-392, 1985.

B. Steinberg, On some algorithmic properties of finite state automorphisms of rooted trees Algorithmic problems of group theory, their complexity, and applications to cryptography. T. 633, Contemp. Math. Amer. Math. Soc, vol.56, pp.115-123

B. Steinberg, M. Vorobets, and Y. Vorobets, AUTOMATA OVER A BINARY ALPHABET GENERATING FREE GROUPS OF EVEN RANK, International Journal of Algebra and Computation, vol.4, issue.01n02, pp.329-354, 2011.
DOI : 10.1007/s10711-006-9060-5

Z. ?uni? and E. Ventura, The conjugacy problem in automaton groups is not solvable, Journal of Algebra, vol.364
DOI : 10.1016/j.jalgebra.2012.04.014

A. M. Vershik, Nonfree actions of countable groups and their characters, Journal of Mathematical Sciences, vol.81, issue.1, pp.1-6, 2011.
DOI : 10.2307/2372852
URL : http://www.pdmi.ras.ru/%7Evershik/nonfree.pdf

M. Vorobets and Y. Vorobets, On a free group of transformations defined by an automaton, Geometriae Dedicata, vol.100, issue.1, pp.237-249, 2007.
DOI : 10.1007/s10711-006-9060-5

M. Vorobets and Y. Vorobets, On a series of finite automata defining free transformation groups, Groups, Geometry, and Dynamics, vol.42, pp.377-405, 2010.
DOI : 10.4171/GGD/87

Y. Vorobets, Notes on the Schreier graphs of the Grigorchuk group, Contemp. Math. Amer. Math. Soc, vol.109, pp.221-248
DOI : 10.1090/conm/567/11250

H. Wang, Proving Theorems by Pattern Recognition - II, Bell System Technical Journal, vol.40, issue.1, pp.1-41, 1961.
DOI : 10.1002/j.1538-7305.1961.tb03975.x

H. S. Wilf, The variance of the Stirling cycle numbers " . In : ArXiv Mathematics e-prints (nov. 2005). eprint : math/0511428 (cf, p.141

J. S. Wilson, On exponential growth and uniformly exponential growth for groups, Inventiones Mathematicae, vol.155, issue.2, pp.287-303, 2004.
DOI : 10.1007/s00222-003-0321-8

E. I. Zel-manov, Solution of the restricted Burnside problem for 2-groups, Matematicheski? ? Sbornik 182-4, pp.568-592, 1991.

E. I. Zel-manov, Solution of the restricted Burnside problem for groups of odd exponent, Izvestiya Akademii Nauk SSSR. Seriya Matematicheskaya 54-1, pp.42-59, 1990.