27 lines
435 B
Markdown
27 lines
435 B
Markdown
|
# L-Systems
|
||
|
|
|
||
|
|
An L-System is an allgorithm that rewrites strings of text over and over again using predetermined rules.
|
||
|
|
|
||
|
|
## Alphabet
|
||
|
|
|
||
|
|
The set of all characters that are allowed in an L-System.
|
||
|
|
|
||
|
|
*Example:*
|
||
|
|
- **[A,B]**
|
||
|
|
|
||
|
|
## Axiom
|
||
|
|
|
||
|
|
The initial text the L-System starts out with, for
|
||
|
|
|
||
|
|
*Example*
|
||
|
|
- **A**
|
||
|
|
|
||
|
|
## Rule set
|
||
|
|
|
||
|
|
The rules that are applied in each generation to the text.
|
||
|
|
|
||
|
|
*Example:*
|
||
|
|
|
||
|
|
- **A** becomes **ABA**
|
||
|
|
- **B** becomes **BBB**
|