\input zb-basic
\input zb-ioport
\iteman{io-port 05580907}
\itemau{Nekrashevych, Volodymyr}
\itemti{Self-similar groups and their geometry.}
\itemso{S\~ao Paulo J. Math. Sci. 1, No. 1, 41-95 (2007).}
\itemab
From the introduction: This is an overview of results concerning applications of self-similar groups generated by automata to fractal geometry and dynamical systems. Few proofs are given, interested reader can find the rest of the proofs in the monograph [{\it V. Nekrashevych}, Self-similar groups. Mathematical Surveys and Monographs 117. Providence, RI: American Mathematical Society (2005; Zbl 1087.20032)]. The paper has the following structure. Section ``Self-similar actions and automata'' provides the basic notions from automata theory and theory of groups acting on rooted trees. It also gives some classical examples of self-similar groups. Section ``Permutational bimodules'' develops algebraic tools which are used in the study of self-similar groups. We define the notion of a permutational bimodule, which gives a convenient algebraic interpretation of automata. A closely related notion is virtual endomorphism, which can be used to construct explicit self-similar actions. We describe at the end of the section self-similar actions of free Abelian groups and show how they are related to numeration systems on $\bbfZ^n$. Section 4 defines iterated monodromy groups. We show how to compute them (their standard actions) as groups generated by automata. Section 5 studies contracting self-similar actions and defines their limit spaces $\cal J_G$. We also prove some basic properties of the limit spaces, limit $G$-spaces and tiles. The last section shows connections of the obtained results with other topics of mathematics. Subsection 6.2 shows that Julia sets of post-critically finite rational functions are limit spaces of their iterated monodromy groups. Next two subsections show a connection between topology of the limit spaces and a notion of bounded automata from [{\it S. Sidki}, J. Math. Sci., New York 100, No. 1, 1925--1943 (2000; Zbl 1069.20504)] and construct an iterative algorithm finding approximations of the limit space of actions by bounded automata. In Subsection 6.5 automata generating iterated monodromy groups of complex polynomials are described. We will see in particular, that iterated monodromy groups of complex polynomials are generated by bounded automata, so that the algorithm of the previous subsection can be used to draw topological approximations of the Julia sets of polynomials. We study in the last subsection the limit spaces of free Abelian groups and fit the theory of self-affine ``digit'' tilings in the framework of self-similar groups and their limit spaces.
\itemrv{~}
\itemcc{}
\itemut{}
\itemli{}
\end