Formal Grammars · Fractals

L-Systems & Fractal Grammars

A hand-checked collection of resources on Lindenmayer systems (L-systems): the parallel string-rewriting grammars Aristid Lindenmayer devised in 1968 to model cell growth — now a mainstay of turtle-graphics fractal rendering and procedural plant generation.

Theory & Foundations

3 resources
L-system by Wikipedia
en.wikipedia.org
An Introduction to Lindenmayer Systems
www1.biologie.uni-hamburg.de
↑ Back to top

Tutorials & Implementations

3 resources
Intro to L-systems
morphocode.com
L-systems
jsantell.com
↑ Back to top

Frequently Asked Questions

What is an L-system?

An L-system, or Lindenmayer system, is a parallel string-rewriting grammar devised by Aristid Lindenmayer in 1968 to model cell growth. It is now widely used for turtle-graphics fractals and procedural plant generation.

Where can I learn about L-systems?

The page lists foundations such as Wikipedia's L-system article, an introduction from the University of Hamburg and notes from the University of New Mexico, plus tutorials from Morphocode and jsantell.

Can I use L-systems in software?

Yes. The page links to SideFX's L-System geometry node in Houdini and to tutorials with implementations.

What topics on this site are related?

Mathematics, theoretical computer science, formal methods, coding theory and algebra.

What does this page cover?

This page covers hand-checked guide to L-systems (Lindenmayer systems): formal grammars, turtle graphics, fractal generation and tools such as Houdini's L-System node.