Lindenmayer (L)-System
Jump to navigation
Jump to search
A Lindenmayer (L)-System is a parallel rewriting system.
- See: Fractal, Rewriting System, Formal Grammar.
References
2020
- (Wikipedia, 2020) ⇒ https://en.wikipedia.org/wiki/L-system Retrieved:2020-1-7.
- 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 [1] and can be used to generate self-similar fractals.
- ↑ Grzegorz Rozenberg and Arto Salomaa. The mathematical theory of L systems (Academic Press, New York, 1980).
1995
- (Lantin & Fracchia, 1995) ⇒ Maria Lantin, and F. David Fracchia. (1995). “Generalized Context-sensitive Cell Systems.” In: First International Workshop in Information Processing in Cells And Tissues.