On the Descriptional Complexity of Some Variants of Lindenmayer Systems

We define the number of productions and the number of symbols as complexity measures for interactionless Lindenmayer systems with a completely parallel derivation process and for some variants of limited Lindenmayer systems with a partially parallel derivation process and for the associated languages. We prove that up to an initial part any natural number can occur as complexity of some language. Moreover, we show the existence of languages with small descriptional complexity with respect to one mechanism and large complexity with respect to the other device.