WOLFRAM|DEMONSTRATIONS PROJECT

3D Deterministic Context-Free (DOL) Systems

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