L-systems generate weevils, pizza toppings, and matriarchal lineages

L-systems are simple rewriting schemes in which symbols are repeatedly replaced by fixed strings; applying that idea to Fibonacci's rabbit puzzle yields the Fibonacci L-system with rules b → a and a → ab. Starting from a single baby symbol and iterating those substitutions produces a sequence of strings whose total lengths - and the counts of a's or b's - grow according to the Fibonacci numbers. The exposition shows how those local replacement rules encode the same recurrence as in Fibonacci's original problem and makes clear that the combinatorial growth emerges from string rewriting rather than explicit arithmetic.

That mechanism is then used playfully to generate stretched variants of familiar words: iterative substitution on name fragments produces progressively longer weevil names modeled on Zyzzyva, bloated versions of pepperoni, and recursive matriarchal nicknames based on Grandma. One example required intentionally skipping a substitution to keep the result pronounceable; without that tweak the expansion becomes a near-unreadable jumble. The piece is a concise, humorous demonstration that a tiny generative rule can produce both mathematically interesting growth (Fibonacci counts) and entertaining string morphologies, noting a related prior exploration and a failed attempt to enlist an AI assistant.