Automata generating free products of groups of order 2

2008/06/30 by Dmytro Savchuk, Savchuk, Dmytro, Yaroslav Vorobets +1 · 1 citation
Mathematics · #20E05 #20E08 #FOS: Mathematics #Group Theory (math.GR) #math.GR #msc:20E05 #msc:20E08

paper · pdf · doi:10.48550/arxiv.0806.4801

19 pages, 4 figures

arxiv created 2008/06/30 · arxiv updated 2009/12/01

Abstract

We construct a family of automata with n states, n>3, acting on a rooted binary tree that generate the free products of cyclic groups of order 2.

Cited by

• On bireversible automata and commensurators of groups in automorphisms of their Cayley graphs

Related

• Automata over a binary alphabet generating free groups of even rank
• On a series of finite automata defining free transformation groups
• On a free group of transformations defined by an automaton
• Examples of defining groups by finite automata
• Groups generated by 3-state automata over a 2-letter alphabet, II