Difference between revisions of "Lsystem"

From Free Software Directory
Jump to: navigation, search
(Created page with "{{Entry |Name=Lsystem |Short description=an implementation of Lindenmayer systems (also called L-systems, substitution systems). |Full description=A simple implementation of Lind...")
 
(No version changes)
 
Line 3: Line 3:
 
|Short description=an implementation of Lindenmayer systems (also called L-systems, substitution systems).
 
|Short description=an implementation of Lindenmayer systems (also called L-systems, substitution systems).
 
|Full description=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.
 
|Full description=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.
 +
|Homepage URL=http://www.alcyone.com/software/lsystem/
 
|User level=intermediate
 
|User level=intermediate
|Status=Live
 
|Component programs=
 
|Homepage URL=http://www.alcyone.com/software/lsystem/
 
|VCS checkout command=
 
 
|Computer languages=Python
 
|Computer languages=Python
|Documentation note=
 
|Paid support=
 
|IRC help=
 
|IRC general=
 
|IRC development=
 
|Related projects=
 
 
|Keywords=string,Python,fractal,tag,Alphabet,fractals,AI,artificial intelligence,symbol,symbols,sequential
 
|Keywords=string,Python,fractal,tag,Alphabet,fractals,AI,artificial intelligence,symbol,symbols,sequential
|Is GNU=n
 
|Last review by=Kelly Hopkins
 
|Last review date=2009-05-01
 
|Submitted by=Database conversion
 
|Submitted date=2011-04-01
 
 
|Version identifier=1.0
 
|Version identifier=1.0
|Version date=2009-05-01
+
|Version date=2002/07/29
 
|Version status=stable
 
|Version status=stable
 
|Version download=http://www.alcyone.com/pyos/lsystem/lsystem-latest.tar.gz
 
|Version download=http://www.alcyone.com/pyos/lsystem/lsystem-latest.tar.gz
 +
|Last review by=Alejandroindependiente
 +
|Last review date=2017/03/01
 +
|Submitted by=Database conversion
 +
|Submitted date=2011-04-01
 +
|Status=
 +
|Is GNU=No
 +
|License verified date=2009-05-01
 +
}}
 +
{{Project license
 +
|License=GPLv2
 +
|License verified by=Kelly Hopkins
 
|License verified date=2009-05-01
 
|License verified date=2009-05-01
|Version comment=
 
 
}}
 
}}
 
{{Person
 
{{Person
 +
|Real name=Erik Max Francis
 
|Role=Maintainer
 
|Role=Maintainer
|Real name=Erik Max Francis
 
 
|Email=pyos@alcyone.com
 
|Email=pyos@alcyone.com
 
|Resource URL=
 
|Resource URL=
Line 39: Line 35:
 
|Use=science
 
|Use=science
 
}}
 
}}
{{Project license
+
{{Featured}}
|License=GPLv2
 
|License verified by=Kelly Hopkins
 
|License verified date=2009-05-01
 
}}
 

Latest revision as of 09:58, 1 March 2017


[edit]

Lsystem

http://www.alcyone.com/software/lsystem/
an implementation of Lindenmayer systems (also called L-systems, substitution systems).

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

License

GPLv2

Verified by

Kelly Hopkins

Verified on

1 May 2009




Leaders and contributors

Contact(s)Role
Erik Max Francis Maintainer


Resources and communication

Software prerequisites




Entry
















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 or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.