Automata generating free products of groups of order 2
arXiv:0806.4801
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.
19 pages, 4 figures
arXiv:0806.4801
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.
19 pages, 4 figures