L-System Generator
Expand a Lindenmayer system from an axiom and rules over a chosen number of iterations.
- Runs in your browser
- Nothing uploaded
- Free, no sign-up
Calculated locally in your browser. Nothing is uploaded.
How to Use L-System Generator
- Enter an axiom. The starting string.
- Enter rules. One per line, like A=AB.
- Set the iterations. How many times to apply the rules.
- Copy the result. Click Copy result. It all runs in your browser.
Frequently Asked Questions
What is an L-system?
A Lindenmayer system, which grows a string by repeatedly replacing each symbol using a set of rules, starting from an axiom.
How do I write a rule?
As a single symbol, an equals sign, and its replacement, such as A=AB. Put one rule per line.
What are L-systems used for?
They model plant growth and draw fractals when the output string is read as drawing commands.
Is anything uploaded?
No. The expansion runs in your browser, so nothing leaves the tab.
Is it free?
Yes. Every tool here is free to use with no sign up.
Related Tools
Age Calculator - Years, Months and Days →
Free age calculator. Find your exact age in years, months and days from your…
Calculate Factorial →
Calculate Factorial up to n=5,000 with exact BigInt arithmetic. Free, offline, client-side - includes…
Date Difference Calculator - Days Between →
Free date difference calculator. Find the time between two dates in years, months and…
Discount Calculator - Sale Price and Savings →
Free discount calculator. Enter a price and percent off to get the sale price…
Find All Divisors →
Find every divisor of any integer up to 1 billion - divisor count, sum,…
Fraction Calculator - Add, Subtract, Multiply →
Free fraction calculator. Add, subtract, multiply or divide two fractions and get a simplified…
Generate Abundant Numbers →
Generate abundant numbers, whose proper divisors add up to more than the number itself.
Generate Almost Perfect Numbers →
Find almost perfect numbers up to a limit, whose divisors sum to one less…
Generate the Baum-Sweet Sequence →
Generate the Baum-Sweet sequence, based on odd-length zero blocks in binary positions.
Generate Deficient Numbers →
Generate deficient numbers, whose proper divisors add up to less than the number itself.
Generate Fibonacci Primes →
Generate Fibonacci primes, the Fibonacci numbers that are also prime, with exact arithmetic.
Generate Fibonacci Words →
Generate the Fibonacci words, the successive strings from the a to ab substitution rule.