Lsystem
This entry published by the Free Software Foundation.
Lsystem
http://www.alcyone.com/software/lsystem/
A simple implementation of Lindenmayer systems (also called L-systems, substitution systems) is provided. In basic form, a Lindenmayer system consists of a starting string of symbols from an alphabet, and has repeated transitions applied to it, specified by a list of transition search-and-replace rules. In addition to the standard formulation, two alternative implementations are included: sequential systems, in which at most one rule is applied; and tag systems, in which the transition only takes place at the beginning and end of the string.
Licensing
| License | Verified by | Verified on | Notes |
|---|---|---|---|
| GPLv2 | Kelly Hopkins | 2454952.51 May 2009 |
Leaders and contributors
| Contact(s) | Role |
|---|---|
 Erik Max Francis | Maintainer |
Resources and communication
Software prerequisites
Click here if you'd like to report a problem or make a suggestion that could
This entry (in part or in whole) was last reviewed on 1 May 2009.
Problem with this listing?
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.
The copyright and license notices on this page only apply to the text on this page. Any software described in this text has its own copyright notice and license, which can usually be found in the distribution itself.
This page was last modified on 12 April 2011, at 15:47.