flâneur — a map of the web's best reading

L-system

en.wikipedia.org · 5,281 words · saved by 5 readers

An L-system or Lindenmayer system is a parallel rewriting system and a type of formal grammar. An L-system consists of an alphabet of symbols that can be used to make strings, a collection of production rules that expand each symbol into some larger string of symbols, an initial "axiom" string from which to begin construction, and a mechanism for translating the generated strings into geometric structures. L-systems were introduced and developed in 1968 by Aristid Lindenmayer, a Hungarian theoretical biologist and botanist at the University of Utrecht. Lindenmayer used L-systems to describe the behaviour of plant cells and to model the growth processes of plant development. L-systems have also been used to model the morphology of a variety of organisms and can be used to generate self-similar fractals.

L-system - Wikipedia Jump to content From Wikipedia, the free encyclopedia Rewriting system and type of formal grammar This article has multiple issues. Please help improve it or discuss these issues on the talk page . ( Learn how and when to remove these messages ) This article may incorporate text from a large language model , which is prohibited in Wikipedia articles . It may include hallucinated information, copyright violations , claims not verified in cited sources, original research , or fictitious references . Any such material should be removed . ( October 2025 ) ( Learn how and when

Explore this link on the map →

saved by

related reading