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

DOI10.1142/S0218196706003037MaRDI QIDQ5483469zbMATHFDO

Authors 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) Extensions, wreath products, and other compositions of groups (20E22) Generators, relations, and presentations of groups (20F05)

Recommendations

• scientific article; zbMATH DE number 2201548
• The characterization by automata of certain profinite groups.
• The automaton realization of iterated wreath products of cyclic groups.
• The classification of abelian groups generated by time-varying automata and by Mealy automata over the binary alphabet
• The Rank and Generating Set for Iterated Wreath Products of Cyclic Groups

Cites work

• scientific article; zbMATH DE number 1544074 (Why is no real title available?)
• A family of groups with nice word problems
• Sequential Functions
• The lamplighter group as a group generated by a 2-state automaton, and its spectrum
• The probability of generating certain profinite groups by two elements

Cited in

(12)

• On some universal construction of minimal topological generating sets for inverse limits of iterated wreath products of non-abelian finite simple groups
• The classification of abelian groups generated by time-varying automata and by Mealy automata over the binary alphabet
• The concept of self-similar automata over a changing alphabet and lamplighter groups generated by such automata
• Finite generation of iterated wreath products.
• The characterization by automata of certain profinite groups.
• The rank and generating set for inverse limits of wreath products of Abelian groups.
• scientific article; zbMATH DE number 2201548 (Why is no real title available?)
• The Rank and Generating Set for Iterated Wreath Products of Cyclic Groups
• On mep-relations in the wreath product of groups.
• The generalized dihedral groups \(\text{Dih}(\mathbb{Z}^n)\) as groups generated by time-varying automata.
• The automaton realization of iterated wreath products of cyclic groups.
• The concept of duality for automata over a changing alphabet and generation of a free group by such automata

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

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