About L-Systems
An L-System is a type of generative grammar (rewriting system), formulated by Aristid Lindenmayer in 1968. L-Systems were originally tasked for the modeling of the growth of plants, but when used in conjunction with turtle graphics, can be used to generate complex patterns of an interesting nature.
A context-free L-System falls in the category of the finite languages, and is composed of three parts:
- A Alphabet, the set of all symbols used by the L-System.
- A set of Productions, which define how each symbol is rewritten on expansion.
- An Axiom, the initial string to which the set of Productions is applied repeatedly to generate subsequent generations.
A set of example L-Systems may be found on the Gallery Page.
An example L-System/Turtle Graphics combination is provided on the Renderer Page.
An explanation of how symbols are interpreted by the turtle to generate an image is provided on the Tokens Page.