Self-similar groups and the zig-zag and replacement products of graphs

Every finitely generated self-similar group naturally produces an infinite sequence of finite d  -regular graphs ΓnΓn. We construct self-similar groups, whose graphs ΓnΓn can be represented as an iterated zig-zag product and graph powering: Γn+1=Γnkz⃝Γ (k≥1k≥1). We also construct self-similar groups, whose graphs ΓnΓn can be represented as an iterated replacement product and graph powering: Γn+1=Γnkr⃝Γ (k≥1k≥1). This gives simple explicit examples of self-similar groups, whose graphs ΓnΓn form an expanding family, and examples of automaton groups, whose graphs ΓnΓn have linear diameters diam(Γn)=O(n)diam(Γn)=O(n) and bounded girth.