Non-contracting groups generated by (3,2)-automata
- Publication Type:
- Journal Article
- Algebra and Discrete Mathematics, 2014, 17 (1), pp. 20 - 32
- Issue Date:
Copyright Clearance Process
- Recently Added
- In Progress
- Open Access
This item is open access.
© Journal Algebra and Discrete Mathematics. We add to the classification of groups generated by 3-state automata over a 2-letter alphabet given by Bondarenko et al., by showing that a number of the groups in the classification are non-contracting. We show that the criterion we use to prove a self-similar action is non-contracting also implies that the associated self-similarity graph introduced by Nekrashevych is non-hyperbolic.
Please use this identifier to cite or link to this item: