We investigate the complexity of various classes of H systems from the point of view of the length of their splicing rules. Specifically, we consider the diameter of an H system, the quadruple of integers representing the maximal length of strings in the rules of the system. We systematically examine the classes of controlled and distributed H systems and their relations with the language families in the Chomsky hierarchy. We obtain improvements of the results on those systems from the point of view of the diameter.*; *Originally published in MAI Vol. 38, No. 1. Reprinted here with corrected author name. |