Groups generated by 3-state automata over a 2-letter alphabet, II

2007/04/30 by Ievgen Bondarenko, Bondarenko, Ievgen, Rostislav Grigorchuk +12
Biochemistry, Genetics and Molecular Biology · Computer Science · Mathematics · #Chemical Synthesis and Analysis #DNA and Biological Computing #math.GR #msc:20E08 #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.0704.3876

26 pages, 31 figures

arxiv created 2007/04/30 · arxiv updated 2009/12/01

Abstract

Classification of groups generated by 3-state automata over a 2-letter alphabet started in the first paper (see http://www.arxiv.org/abs/math/0612178) is continued.

Citations

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

Related

• Classification of groups generated by 3-state automata over a 2-letter alphabet
• 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