The Hausdorff and box-counting dimensions of a class of recurrent sets

It is well known that a lot of familiar fractal sets can be generated using recurrent method. Conclusions under similitude linear map are straightforward. In this paper, we study the upper and low bounds for the Hausdorff dimension and boxing-counting dimension of recurrent sets. Especially, we focus our attention on the case of the non-similitude.