Wolfram Demonstrations Project

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
After work by: Premyslaw Prusinkiewicz and Aristid Lindenmayer

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.

Lindenmayer System (Wolfram MathWorld)

String Rewriting System (Wolfram MathWorld)

"Deterministic Context Free (DOL) Systems" from the Wolfram Demonstrations Project
http://demonstrations.wolfram.com/DeterministicContextFreeDOLSystems/

Contributed by: John Cicilio

After work by: Premyslaw Prusinkiewicz and Aristid Lindenmayer

- 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 »

Download Demonstration as CDF »

Download Author Code »(preview »)

Files require Wolfram CDF Player or Mathematica.

Related Topics

Browse all topics

RELATED RESOURCES

Mathematica » The #1 tool for creating Demonstrations and anything technical.	Wolfram\|Alpha » Explore anything with the first computational knowledge engine.	MathWorld » The web's most extensive mathematics resource.	Course Assistant Apps » An app for every course— right in the palm of your hand.
Wolfram Blog » Read our views on math, science, and technology.	Computable Document Format » The format that makes Demonstrations (and any information) easy to share and interact with.	STEM Initiative » Programs & resources for educators, schools & students.	Computerbasedmath.org » Join the initiative for modernizing math education.

Deterministic Context Free (DOL) Systems

SNAPSHOTS

DETAILS

RELATED LINKS

PERMANENT CITATION

Related Topics