X-machines+L-systems=XL-systems

Abstract

A. Lindenmayer (1968) developed a type of formal language called an L-system. Similar to formal languages, L-systems define a method by which a string of symbols can be rewritten or parsed into another string using a set of rewrite rules. X-machines are generalised state automata. This paper takes another look at this way of generating plants and provides a convenient way of taking component L-systems that exhibit some property and combining them using an X-machine so that each L-system contributes its properties or behaviour. The result is a plant which has some characteristics of each of its components.