“…Later, Bondarenko, D'Angeli and Rodaro constructed a bireversible automaton generating the group
[
1], thus obtaining the first (infinite) solvable example. This led to an interest in understanding which groups of the form
with
finite abelian, sometimes known as lamplighter groups , can be obtained from such automata, culminating in the recent work of Skipper and Steinberg [
11], who proved that if
satisfies some technical condition on the Sylow 2‐subgroup of the group
(we refer the reader to [
11] for the precise condition), then
can be generated by a bireversible automaton. Unfortunately, their result does not say anything about the groups not satisfying this condition, and in particular, it does not cover the case of the classical lamplighter group
.…”