Horofunctions on Sierpi\'nski type triangles

We study an infinite set of graphs which are recursively constructed from an infinite word in a finite alphabet. These graphs are inspired by the construction of the Sierpi'nski gasket. We show that there are infinitely many non-isomorphic such graphs and we describe the horofunctions on the standard case.