Abstract
In this paper we give a complete classification of the infinite Schreier graphs of an automaton group generated by an extended version of the binary adding machine.
| Original language | English |
|---|---|
| Article number | P.4.20 |
| Number of pages | 14 |
| Journal | The Electronic Journal of Combinatorics |
| Volume | 21 |
| Issue number | 4 |
| Publication status | Published - 2014 |
Fields of Expertise
- Information, Communication & Computing