ON GENERATION OF WREATH PRODUCTS OF CYCLIC GROUPS BY TWO STATE TIME VARYING MEALY AUTOMATA

DOI10.1142/S0218196706003037zbMath1150.20012MaRDI QIDQ5483469

Adam Woryna

Publication date: 14 August 2006

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

zbMATH Keywords

iterated wreath productsgroups generated by time-varying automatatime-varying Mealy automata

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)

Related Items (9)

The classification of abelian groups generated by time-varying automata and by Mealy automata over the binary alphabet ⋮ Finite generation of iterated wreath products. ⋮ The concept of self-similar automata over a changing alphabet and lamplighter groups generated by such automata ⋮ The rank and generating set for inverse limits of wreath products of Abelian groups. ⋮ The concept of duality for automata over a changing alphabet and generation of a free group by such automata ⋮ On some universal construction of minimal topological generating sets for inverse limits of iterated wreath products of non-abelian finite simple groups ⋮ The Automaton Realization of Iterated Wreath Products of Cyclic Groups ⋮ The characterization by automata of certain profinite groups. ⋮ The Rank and Generating Set for Iterated Wreath Products of Cyclic Groups

Cites Work

• Unnamed Item
• The probability of generating certain profinite groups by two elements
• Sequential Functions
• A family of groups with nice word problems
• The lamplighter group as a group generated by a 2-state automaton, and its spectrum

This page was built for publication: ON GENERATION OF WREATH PRODUCTS OF CYCLIC GROUPS BY TWO STATE TIME VARYING MEALY AUTOMATA