Lindenmayer System

A Lindenmayer system, also known as an L-system, is a string rewriting system that can be used to generate fractals with dimension between 1 and 2. Several example fractals generated using Lindenmayer systems are illustrated above.

REFERENCES:

Bulaevsky, J. "-System Based Fractals." http://ejad.best.vwh.net/java/fractals/lsystems.shtml.

Bulaevsky, J. "A Process to Generate Fractals." http://ejad.best.vwh.net/java/fractals/process.shtml.

Charpentier, M. "L-Systems in PostScript." http://www.cs.unh.edu/~charpov/Programming/L-systems/.

Dickau, R. M. "Two-dimensional L-systems." http://mathforum.org/advanced/robertd/lsys2d.html.

Prusinkiewicz, P. and Hanan, J. Lindenmayer Systems, Fractal, and Plants. New York: Springer-Verlag, 1989.

Prusinkiewicz, P. and Lindenmayer, A. The Algorithmic Beauty of Plants. New York: Springer-Verlag, 1990.

Stevens, R. T. Fractal Programming in C. New York: Holt, 1989.

Wagon, S. "Recursion via String Rewriting." §6.2 in Mathematica in Action. New York: W. H. Freeman, pp. 190-196, 1991.