Groups generated by 3-state automata over a 2-letter alphabet. I.

DOI10.11606/ISSN.2316-9028.V1I1P1-39MaRDI QIDQ2390124zbMATHOpenAlexWikidataFDO

Authors Dmytro Savchuk, Zoran Šunić, Ievgen Bondarenko, R. I. Grigorchuk, Rostyslav V. Kravchenko, Ye. V. Muntyan, Volodymyr Nekrashevych

Publication date 20 July 2009

Published in São Paulo Journal of Mathematical Sciences (Search for Journal in Brave)

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

zbMATH Keywords

automaton groupsgroups generated by automatainvertible automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Groups acting on trees (20E08) 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)

Abstract: An approach to a classification of groups generated by 3-state automata over a 2-letter alphabet and the current progress in this direction are presented. Several results related to the whole class are formulated. In particular, all finite, abelian, and free groups are classified. In addition, we provide detailed information and complete proofs for several groups from the class, with the intention of showing the main methods and techniques used in the classification.

Recommendations

• On classification of groups generated by automaton with three states over alphabet of two letters, and on some questions concerned with such groups.
• Groups generated by 3-state automata over a 2-letter alphabet. II.
• Classification of groups generated by 3-state automata over a 2-letter alphabet
• A class of two generated automaton groups on a three letter alphabet.
• On finite and Abelian groups generated by finite automata.

Cited in

(10)

• On finite and Abelian groups generated by finite automata.
• Groups generated by 3-state automata over a 2-letter alphabet. II.
• A class of two generated automaton groups on a three letter alphabet.
• The classification of abelian groups generated by time-varying automata and by Mealy automata over the binary alphabet
• Classification of groups generated by 3-state automata over a 2-letter alphabet
• Pattern closure of groups of tree automorphisms.
• On orbits and the finiteness of bounded automaton groups
• Joint spectrum and the infinite dihedral group
• On the lattice of subgroups of the lamplighter group.
• On classification of groups generated by automaton with three states over alphabet of two letters, and on some questions concerned with such groups.

This page was built for publication: Groups generated by 3-state automata over a 2-letter alphabet. I.

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