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.