Everything About ___
Live briefing

Everything about L-system

Rewriting system and type of formal grammar

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. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: L-systemA 5-minute orientation
  2. Skim a recent paper: Software update: The ORCA program system—Version 5.0Influential work since 2022
  3. Pick up a classic book: Management information systemsThe most-reprinted book on the subject
  4. Read the landmark paper: UCSF Chimera—A visualization system for exploratory research and analysisCited 45,725 times
  5. Go sideways: Grammar inductionA closely related topic
  6. Go sideways: Probabilistic context-free grammarA closely related topic

📖 Definitions

No dictionary entry for this exact phrase.

🗂️ The subject at a glance

  1. Origins
  2. L-system structure
  3. Examples of L-systems
  4. Variations
  5. L-system Construction and Inference
  6. Open problems
  7. Types of L-systems
  8. Books

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics