10527
EXPLORE
LATEST
ABOUT
AUTHORING AREA
PARTICIPATE
Your browser does not support JavaScript or it may be disabled!
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.
Contributed by:
John Cicilio
After work by:
Premyslaw Prusinkiewicz
and
Aristid Lindenmayer
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.
RELATED LINKS
Lindenmayer System
(
Wolfram
MathWorld
)
String Rewriting System
(
Wolfram
MathWorld
)
PERMANENT CITATION
"
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 Demonstrations
More by Author
3D Deterministic Context-Free (DOL) Systems
John Cicilio
Random Branching Process in 3D
Stephen Wolfram
Limits of Tree Branching
Stephen Wolfram
Tree Branching in 4D
Todd Rowland
Fibonacci Tree
Sándor Kabai
Dendrimer to Linear Polymer Transition
Borislav Angelov
Random Branching Process
Stephen Wolfram
k-Cayley Trees
Filip Piekniewski
Regular k-ary Trees
Stephen Wolfram
Fractal Trees
Stephen Wolfram
Related Topics
Discrete Mathematics
Fractals
Generation of Form
Growth Processes
Trees
Browse all topics
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to
Mathematica Player 7EX
I already have
Mathematica Player
or
Mathematica 7+