Examples for

Substitution Systems

Substitution systems, or L-systems, are a type of simple computational system, or automaton, capable of simple and complex behavior, even chaos, depending on the initial condition and evolution rule. For many substitution system rules, including neighbor-dependent rules, Wolfram|Alpha can simulate, analyze, compute statistics, create interactive visualizations (including tree and subdivision diagrams) and fit a conjecture about the growth of string lengths in the system.

Examine substitution system simulations, including neighbor-dependent and neighbor-independent systems.

Analyze a substitution system:

substitution system 1->0, 0->10

substitution system 0->10, 1->01

substitution system 1->2, 2->31, 3->24, 4->15, 5->2

Specify a neighbor-dependent system:

Lindenmayer system 01->1, 1->01, 0->10

substitution system 01->2, 2->012, 1->12

More examples