An automaton group: a computational case study

Document Type: Research Paper

Author

Professor of mathematics Dept of maths and stats, Allameh tabatabaei univ.

Abstract

We introduce a two generated weakly branch contracting automaton
group $G$ which is generated by a two state automaton on a three
letter alphabet. Using its branch structure and the finiteness
nature of a sequence of its factor groups we compute the order of
some of these factors. Furthermore some algebraic properties of $G$
are detected .

Keywords

Main Subjects



Volume 38, Issue 4
November and December 2012
Pages 907-924
  • Receive Date: 13 October 2010
  • Revise Date: 20 April 2011
  • Accept Date: 20 April 2011