找到一种估计具有重叠结构迭代吸引子的维数下界的方法,并以此方法得出具有重叠结构的有向图集的Hausdorff维数的一个下界估计.
A kind of method which can estimate the Hausdorff dimension for attractors with Overlaps has been found, and by this way a lower estimate of the Hausdorff dimension for directed graph set which can be obtained by an overlapping construction has been given.