Abstract
We construct a bireversible self-dual automaton with three states over an alphabet with three letters which generates the lamplighter group ℤ3≀ℤ. In particular, this fact shows that not all groups defined by birevirsible automata are finitely presented.
Original language | English |
---|---|
Pages (from-to) | 5257-5268 |
Journal | Communications in Algebra |
Volume | 44 |
Issue number | 12 |
DOIs | |
Publication status | Published - 2016 |
Fields of Expertise
- Information, Communication & Computing
Treatment code (Nähere Zuordnung)
- Theoretical