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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call