The Recursive Number Rewriter simulates string rewriting grammars. Define custom substitution rules and watch how an initial seed string evolves across multiple recursive iterations.
Rewrite Numbers (L-System)
Recursively rewrite strings of numbers and characters based on grammatical production rules. Mimics Lindenmayer systems used in fractal generation.
Grammar Rules
Resulting String
About Rewrite Numbers (L-System)
Features
- Multi-Rule Expansion: Supports custom substitution rules.
- Iteration Control: Step through generations safely.
How to Use
- Set Axiom: Enter the starting number or character sequence.
- Define Rules: Specify what characters transform into.
- Run Iterations: Expand the string across multiple generations.
Frequently Asked Questions
What is an L-System?
A Lindenmayer system (or L-system) is a parallel rewriting system consisting of an alphabet of symbols, a starting axiom string, and a set of production rules that expand symbols recursively.
How do number rewrites work?
Every iteration checks each digit against your production rules (e.g., replace every 1 with 10 and every 0 with 1). The string grows exponentially with each iteration.