Classification of groups generated by 3-state automata over a 2-letter alphabet

2008/03/25 by Ievgen Bondarenko, Rostislav Grigorchuk, Bondarenko, Ievgen +10
Computer Science · Mathematics · #20E08 #FOS: Mathematics #Finite Group Theory Research #Geometric and Algebraic Topology #Group Theory (math.GR) #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.0803.3555

openalex publication_date 2008/03/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This article contains most of the known results on the classification of groups generated by 3-state automata over a 2-letter alphabet, extending the previous papers 0704.3876 and math/0612178.

Citations

• Free subgroups in groups acting on rooted trees

Related

• Groups generated by 3-state automata over a 2-letter alphabet, II
• Groups generated by 3-state automata over a 2-letter alphabet, I
• Examples of defining groups by finite automata
• Some non-contracting automata groups
• Automata over a binary alphabet generating free groups of even rank