| Property |
Value |
| ID | the:l-system |
| @type | rdfs:Resource, skos:Concept, owl:Thing |
| altLabel | Lindenmayer System |
| broader | the:digitalArtTerm, the:visualArtTerm, the:computerArtTerm |
| definition | 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.. |
| identifier | 93c87534-a89d-40a5-ac88-ee455361de6d |
| inScheme | the:computerArtTerms |
| label | l-system |
| note | https://en.wikipedia.org/wiki/L-system |
| tag | work:0b2ea129-63eb-421b-9ec0-c622e365a6da, work:e498f6a8-4567-4afb-9561-3776df12d937, work:8d4f3c26-3a10-4ba0-8fda-9a1a4491f2a3 |