ON THE DESCRIPTIONAL COMPLEXITY OF LINDENMAYER SYSTEMS
Jürgen Dassow · International Journal of Foundations of Computer Science · 2004
We define the number of productions and the number of symbols as measures of descriptional complexity for tabled interactionless Lindenmayer systems and their special cases. We investigate the decrease of the descriptional complexities if we go from a family to another one which has a larger generative capacity.