L-system
id:
l-system-292-8148795
title:
L-system
text:
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 theore
brand slug:
wiki
category slug:
encyclopedia
description:
Rewriting system and type of formal grammar
original url:
https://en.wikipedia.org/wiki/L-system
date created:
date modified:
2024-02-11T18:42:25Z
main entity:
{"identifier":"Q1151098","url":"https://www.wikidata.org/entity/Q1151098"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/7/74/Dragon_trees.jpg","width":800,"height":574}
fields total:
13
integrity:
15