Graph automaton groups
In this paper we define a way to get a bounded invertible automaton starting from a finite graph. It turns out that the corresponding automaton group is regular weakly branch over its commutator subgroup, contains a free semigroup on two elements and is amenable of exponential growth. We also highli...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Aracne
2021-12-01
|
| Series: | Advances in Group Theory and Applications |
| Subjects: | |
| Online Access: | http://www.advgrouptheory.com/journal/Files/click_url.php?id=Volumes/11/CavaleriDAngeliDonnoRodaro.pdf |