Deterministic Context Free (DOL) Systems

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

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.

Contributed by: John Cicilio (March 2011)
After work by: Premyslaw Prusinkiewicz and Aristid Lindenmayer
Open content licensed under CC BY-NC-SA


Snapshots


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.



Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
Send