Deterministic Context Free (DOL) Systems

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.


  • [Snapshot]
  • [Snapshot]
  • [Snapshot]


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.
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.