The concept of self-similar automata over a changing alphabet and lamplighter groups generated by such automata

DOI10.1016/J.TCS.2013.02.027zbMATH Open1291.68233arXiv1607.07650OpenAlexW2077999095MaRDI QIDQ390918FDOQ390918

Authors: Adam Woryna 

Publication date: 9 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Abstract: Generalizing the idea of self-similar groups defined by Mealy automata, we itroduce the notion of a self-similar automaton and a self-similar group over a changing alphabet. We show that every finitely generated residually-finite group is self-similar over an arbitrary unbounded changing alphabet. We construct some naturally defined self-similar automaton representations over an unbounded changing alphabet for any lamplighter group $KwrmathbbZ$ with an arbitrary finitely generated (finite or infinite) abelian group $K$.

Full work available at URL: https://arxiv.org/abs/1607.07650

Recommendations

• ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS
• Extensions of automorphisms of self-similar groups
• Some solvable automaton groups.
• The concept of duality for automata over a changing alphabet and generation of a free group by such automata
• Lamplighter groups and automata

zbMATH Keywords

lamplighter grouprooted treechanging alphabetgroup generated by an automatontime-varying automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Generators, relations, and presentations of groups (20F05) Algebraic theory of languages and automata (68Q70) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cites Work

• Title not available (Why is that?)
• ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS
• Title not available (Why is that?)
• On a free group of transformations defined by an automaton.
• Automata, dynamical systems, and groups
• The lamplighter group as a group generated by a 2-state automaton, and its spectrum
• On a question of Atiyah
• La structure des $p$-groupes de Sylow des groupes symétriques finis
• Piecewise automatic groups.
• Theory of Alëshin type groups
• Algebraic and structural automata theory. Transl. of algebraiczna i structuralna teoria automatów (PWN, Warsaw, 1985)
• Conditions of finiteness in Aleshin-type groups
• Automatically presented groups.
• The spectra of lamplighter groups and Cayley machines.
• Groups generated by 3-state automata over a 2-letter alphabet. II.
• WREATH PRODUCTS AND PERIODIC FACTORABLE GROUPS
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Representations of a free group of rank two by time-varying Mealy automata
• ON GENERATION OF WREATH PRODUCTS OF CYCLIC GROUPS BY TWO STATE TIME VARYING MEALY AUTOMATA
• The concept of duality for automata over a changing alphabet and generation of a free group by such automata
• Stabilizers of suites in Alëshin-type groups

Cited In (11)

• Intransitive self-similar groups
• Affine automorphisms of rooted trees
• The characterization by automata of certain profinite groups.
• On some universal construction of minimal topological generating sets for inverse limits of iterated wreath products of non-abelian finite simple groups
• On groups generated by bi-reversible automata: the two-state case over a changing alphabet
• The lamplighter group of rank two generated by a bireversible automaton
• Some solvable automaton groups.
• The lamplighter group \(\mathbb Z_3 \wr \mathbb Z\) generated by a bireversible automaton
• The classification of abelian groups generated by time-varying automata and by Mealy automata over the binary alphabet
• Extensions of automorphisms of self-similar groups
• ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS

This page was built for publication: The concept of self-similar automata over a changing alphabet and lamplighter groups generated by such automata

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