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

DOI10.1016/j.jalgebra.2014.01.038zbMath1298.20035OpenAlexW2077473112MaRDI QIDQ401945

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

zbMATH Keywords

automaton groupspermutational wreath productsautomaton realizationsgroups generated by automatatrees of wordswreath powers

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite generation of iterated wreath products.
• On a series of finite automata defining free transformation groups.
• Some questions of Edjvet and Pride about infinite groups
• \(1\tfrac 12\)-generation of finite simple groups
• A Wilson group of non-uniformly exponential growth.
• The finite images of finitely generated groups
• Automaton Ranks of Some Self-similar Groups
• AUTOMATA OVER A BINARY ALPHABET GENERATING FREE GROUPS OF EVEN RANK
• ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS
• An Adjacency Criterion for the Prime Graph of a Finite Simple Group
• Classification of groups generated by 3-state automata over a 2-letter alphabet
• Probabilistic Generation of Wreath Products of Non-abelian Finite Simple Groups

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