Complexity of self-similar hierarchically constrained ensembles

The complexity measure of the infinite set of self-similar hierarchically constrained ensembles is determined in the framework of the generalized combinatory approach. It is shown that, as the hierarchical coupling increases, the complexity increases to a value that decreases with increasing the dispersion of this coupling and with decreasing the branching degree of the hierarchical tree.