Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity.

DOI10.1007/BF02677504zbMath1069.20504OpenAlexW2053751591MaRDI QIDQ1580386

Publication date: 14 September 2000

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02677504

zbMATH Keywords

free subgroups growth functions maximal 2-subgroups automorphisms of binary trees Burnside 2-groups output automata

Mathematics Subject Classification ID

Trees (05C05) Formal languages and automata (68Q45) Subgroup theorems; subgroup growth (20E07) Periodic groups; locally finite groups (20F50) Generators, relations, and presentations of groups (20F05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Automorphisms of infinite groups (20E36) Groups acting on trees (20E08)

Related Items

Dimension and randomness in groups acting on rooted trees, The smallest Mealy automaton of intermediate growth., Automaton semigroups: the two-state case., Virtual endomorphisms of nilpotent groups., The group of all finite-state automorphisms of a regular rooted tree has a minimal generating set., Functionally recursive rings of matrices -- two examples, Numerical upper bounds on growth of automaton groups, Implementing Computations in Automaton (Semi)groups, On a free group of transformations defined by an automaton., Hausdorff dimension in a family of self-similar groups., On Mealy–Moore coding and images of Markov measures, Groups and semigroups defined by colorings of synchronizing automata, On amenability of automata groups., Abelian Invertible Automata, Two periodicity conditions for spinal groups, The word problem for finitary automaton groups, Universal groups of intermediate growth and their invariant random subgroups, Monadic second-order logic and the domino problem on self-similar graphs, On a family of Schreier graphs of intermediate growth associated with a self-similar group, Some topics in the dynamics of group actions on rooted trees., On a class of poly-context-free groups generated by automata, Automaton (Semi)groups: Wang Tilings and Schreier Tries, Growth of Schreier graphs of automaton groups., Endomorphisms of regular rooted trees induced by the action of polynomials on the ring ℤd of d-adic integers, Schreier graphs of an extended version of the binary adding machine., FINITE SELF-SIMILAR p-GROUPS WITH ABELIAN FIRST LEVEL STABILIZERS, On irreducibility and disjointness of Koopman and quasi-regular representations of weakly branch groups, Extensive amenability and an application to interval exchanges, THE GROUP OF AUTOMORPHISMS OF A 3-GENERATED 2-GROUP OF INTERMEDIATE GROWTH, ITERATION OF INVERTIBLE TRANSDUCTIONS, Automata and square complexes., Finite automata of polynomial growth do not generate a free group., Amenable groups without finitely presented amenable covers, THE BINARY ADDING MACHINE AND SOLVABLE GROUPS, Positive speed for high-degree automaton groups, Generic properties in some classes of automaton groups, An automata group of intermediate growth and exponential activity, Fragile words and Cayley type transducers, On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata, On orbits and the finiteness of bounded automaton groups, From Self-Similar Groups to Self-Similar Sets and Spectra, Extensions of amenable groups by recurrent groupoids, TREE-WREATHING APPLIED TO GENERATION OF GROUPS BY FINITE AUTOMATA, Graph automaton groups, GROUPS WITH INDEXED CO-WORD PROBLEM, A New Hierarchy for Automaton Semigroups, Wreath operations in the group of automorphisms of the binary tree, Large scale properties for bounded automata groups.

Cites Work