we describe under various conditions abelian subgroups of the automorphism‎ ‎group $mathrm{aut}(t_{n})$ of the regular $n$-ary tree $t_{n}$‎, ‎which are‎ ‎normalized by the $n$-ary adding machine $tau =(e‎, ‎dots‎, ‎e,tau )sigma _{tau‎ ‎}$ where $sigma _{tau }$ is the $n$-cycle $left( 0,1‎, ‎dots‎, ‎n-1right) $‎. ‎as‎ ‎an application‎, ‎for $n=p$ a prime number‎, ‎and for $n=4$‎, ‎we prove that...

We prove that the group of reversible cellular automata (RCA), on any alphabet $A$, contains a subgroup generated by three involutions which an isomorphic copy every finitely RCA $B$. This result follows from