LSystem 1.0

A Lindenmayer system explorer module

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.

• Author: Erik Max Francis <software at alcyone com>
• Maintainer: Erik Max Francis
• Home Page: http://www.alcyone.com/software/lsystem/
• Download URL: http://www.alcyone.com/software/lsystem/lsystem-latest.tar.gz
• Keywords: Lindenmayer systems, Lindemeyer systems, L-systems, fractals, algorithmic beauty of plants, artificial life
• License: GPL
• Platform: any
• Categories
  • Development Status :: 5 - Production/Stable
  • Environment :: Console
  • Intended Audience :: Developers
  • Intended Audience :: Science/Research
  • License :: OSI Approved :: GNU General Public License (GPL)
  • Operating System :: OS Independent
  • Programming Language :: Python
  • Topic :: Scientific/Engineering :: Artificial Intelligence
  • Topic :: Scientific/Engineering :: Mathematics
  • Topic :: Software Development :: Libraries :: Python Modules
• Package Index Owner: xihr
• DOAP record: LSystem-1.0.xml