An automaton group: a computational case study
Mohammad Jelodari Mamaghani · 2012
Abstract. We introduce a two generated weakly branch contract-ing automaton group G which is generated by a two state automa-ton 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 proper-ties of G are detected. 1.