Designing with L-Systems, Part 6: Generating T-Sequence Expressions
Sample pages
Page 1, at reduced quality. Open the document to read every page in full.
A short web article by Ralph Griswold in his L-Systems series that shows how L-System strings can be interpreted as t-sequence expressions. A small terminating L-System produces pal(rpt(U,I)), which evaluates to a palindromic repeat of a sequence. The article explains why separate rules make complex nested expressions easier to understand, and gives a table that maps abstract t-sequence operations (concatenation, repetition, extension, runs, reflection, palindrome, motif, modular reduction and expansion, collation) to concrete L-System function strings. A reference list points to the related t-sequence and L-System articles.
- Type
- Web Doc
- Date
- April 10, 2004
- Language
- English
- Pages
- 2
- Archive notes
- Last revised November 25, 2004
(A free account is all you need)
From Ralph Griswold's Digital Archive, delivered by the University of Arizona.
Have missing pages or a better copy of this document, or another document to share? Contributing documents »