We use the language of formal power series to construct finite state automata generating groups of the form A \wr Z, where A is the additive group of a finite commutative ring and Z is the integers. We then provide conditions on the units of the ring and the power series which make automata bireversible.
This is a joint work with Benjamin Steinberg.