On the automaton complexity of wreath powers of non-Abelian finite simple groups.

DOI10.1016/J.JALGEBRA.2014.01.038zbMATH Open1298.20035OpenAlexW2077473112MaRDI QIDQ401945FDOQ401945

Authors: Adam Woryna 

Publication date: 27 August 2014

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgebra.2014.01.038

Recommendations

• On some universal construction of minimal topological generating sets for inverse limits of iterated wreath products of non-abelian finite simple groups
• \(up\)-wreath powers of permutation groups over finite sets.
• Automaton ranks of some self-similar groups.
• The automaton realization of iterated wreath products of cyclic groups.
• Finite generation of iterated wreath products.

zbMATH Keywords

permutational wreath productsautomaton groupsautomaton realizationsgroups generated by automatatrees of wordswreath powers

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Simple groups: alternating groups and groups of Lie type (20D06) Groups acting on trees (20E08) Extensions, wreath products, and other compositions of groups (20E22) Generators, relations, and presentations of groups (20F05)

Cites Work

• An Adjacency Criterion for the Prime Graph of a Finite Simple Group
• Title not available (Why is that?)
• Finite generation of iterated wreath products.
• ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS
• Automata, dynamical systems, and groups
• Automata over a binary alphabet generating free groups of even rank.
• Classification of groups generated by 3-state automata over a 2-letter alphabet
• On a series of finite automata defining free transformation groups.
• Probabilistic Generation of Wreath Products of Non-abelian Finite Simple Groups
• Some solvable automaton groups.
• Some questions of Edjvet and Pride about infinite groups
• A Wilson group of non-uniformly exponential growth.
• The finite images of finitely generated groups
• \(1\tfrac 12\)-generation of finite simple groups
• Automaton ranks of some self-similar groups.

Cited In (5)

• On exponentiation, p-automata and HNN extensions of free abelian groups
• Representation of wreath powers of a finite group in the automorphism group of a rooted tree.
• \(up\)-wreath powers of permutation groups over finite sets.
• Automaton ranks of some self-similar groups.
• The group of all finite-state automorphisms of a regular rooted tree has a minimal generating set.

This page was built for publication: On the automaton complexity of wreath powers of non-Abelian finite simple groups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q401945)