Deterministic Context Free (DOL) Systems

​
iterations
1
2
3
4
angle
25.7
20
22.5
25.7
60
90
replacement rule
{f,{ff[+f]f[-f][f]}}
This Demonstration contains examples of a deterministic context-free system (DOL system), a simple Lindenmayer system. Here we show some simple recursive string mappings using bracketed and nonbracketed DOL systems.

Details

The examples used are taken from the book by
P. Prusinkiewicz and A. Lindenmayer, The Algorithmic Beauty of Plants, Springer–Verlag, 1990, pp. 1–25.

External Links

Lindenmayer System (Wolfram MathWorld)
String Rewriting System (Wolfram MathWorld)

Permanent Citation

John Cicilio, Premyslaw Prusinkiewicz, Aristid Lindenmayer
​
​"Deterministic Context Free (DOL) Systems"​
​http://demonstrations.wolfram.com/DeterministicContextFreeDOLSystems/​
​Wolfram Demonstrations Project​
​Published: March 7, 2011