On generation of wreath products of cyclic groups by two state time varying Mealy automata

We proof that an infinitely iterated wreath product of finite cyclic groups of pairwise coprime orders is generated as a topological group by two elements a and b. The group G = 〈a, b〉 may be represented by a 2-state time-varying Mealy automaton. We derive some properties of G.