On bireversible Mealy automata and the Burnside problem

In this paper we prove that, in fact, no connected reversible Mealy automaton of prime size can generate an infinite Burnside group. In addition we explain how our method can be applied for some Mealy automata of non prime size.