ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS
From MaRDI portal
Publication:3379492
DOI10.1142/S0218196705002761zbMath1106.20028MaRDI QIDQ3379492
Benjamin Steinberg, Pedro V. Silva
Publication date: 6 April 2006
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Algebraic theory of languages and automata (68Q70) Extensions, wreath products, and other compositions of groups (20E22) Semigroups in automata theory, linguistics, etc. (20M35) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Groups acting on trees (20E08)
Related Items
Automaton semigroups: the two-state case., Affine automorphisms of rooted trees, Self-similar monoids related to Hahn groups, Implementing Computations in Automaton (Semi)groups, Amalgamated free product in terms of automata constructions, Markov semigroups, monoids and groups, Groups and semigroups defined by colorings of synchronizing automata, On the lattice of subgroups of the lamplighter group, The concept of self-similar automata over a changing alphabet and lamplighter groups generated by such automata, Some isomorphism results for Thompson-like groups \(V_n(G)\), On the automaton complexity of wreath powers of non-Abelian finite simple groups., Automaton semigroups and groups: on the undecidability of problems related to freeness and finiteness, Bireversible automata generating lamplighter groups, An automaton group with undecidable order and Engel problems, On an algorithm to decide whether a free group is a free factor of another, On state-closed representations of restricted wreath product of groups \(G_{p,d}=C_{p}wrC^{d}\), Automaton (Semi)groups: Wang Tilings and Schreier Tries, The lamplighter group of rank two generated by a bireversible automaton, AUTOMATA OVER A BINARY ALPHABET GENERATING FREE GROUPS OF EVEN RANK, Rational embeddings of hyperbolic groups, Extensions of automorphisms of self-similar groups, THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE, A geometric approach to (semi)-groups defined by automata via dual transducers., ITERATION OF INVERTIBLE TRANSDUCTIONS, Semigroups arising from asynchronous automata., The spectra of lamplighter groups and Cayley machines., Unnamed Item, Generic properties in some classes of automaton groups, On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata, Automata groups generated by Cayley machines of groups of nilpotency class two, CAYLEY AUTOMATON SEMIGROUPS, Automaton semigroup constructions., Conjugate subgroups and overgroups of Vn, The Lamplighter Group ℤ3≀ℤ Generated by a Bireversible Automaton, ON THE CAYLEY SEMIGROUP OF A FINITE APERIODIC SEMIGROUP, Automaton semigroups, Lamplighter groups, bireversible automata, and rational series over finite rings, Self-automaton semigroups.
Cites Work
- The spectral measure of certain elements of the complex group ring of a wreath product
- Complexity of finite semigroups
- On a question of Atiyah
- MONOIDS ACTING ON TREES: ELLIPTIC AND WREATH PRODUCTS AND THE HOLONOMY THEOREM FOR ARBITRARY MONOIDS WITH APPLICATIONS TO INFINITE GROUPS
- The lamplighter group as a group generated by a 2-state automaton, and its spectrum
