We extend the tree-wreath product of groups introduced by Brunner and the author, as a generalization of the restricted wreath product, thus enlarging the class of groups known to be generated by finite synchronous automata. In particular, we prove that given a countable abelian residually finite 2 -group H and B = B(n,ℤ), a canonical subgroup of finite index in GL(n,ℤ), then the restricted wreath product H wr B can be generated by finite synchronous automata on 0,1. This is obtained by producing a representation of B as a group of automorphisms of the binary tree such that the stabilizer of the infinite sequence of 0's is trivial. The uni-triangular group U = U(n,ℤ) is a subgroup of B(n,ℤ) and so, H wr U also can be generated by finite synchronous automata on 0,1.