On the Descriptional Complexity of Limited Propagating Lindenmayer Systems

TL;DR

This paper explores how the descriptional complexity of limited propagating Lindenmayer systems varies with their generative capacity and compares different variants to identify more efficient language descriptions.

Contribution

It provides a detailed analysis of the complexity differences among variants of Lindenmayer systems and introduces languages that are more efficiently described in specific families.

Findings

Complexity decreases as generative capacity increases.

Languages can be more efficiently described in certain Lindenmayer system variants.

Incomparability of families is demonstrated through specific language examples.

Abstract

We investigate the descriptional complexity of limited propagating Lindenmayer systems and their deterministic and tabled variants with respect to the number of rules and the number of symbols. We determine the decrease of complexity when the generative capacity is increased. For incomparable families, we give languages that can be described more efficiently in either of these families than in the other.