Discovery of rewrite rules in Lindenmayer systems and state transition rules in cellular automata via genetic programming   [LS] [CA] [GP]

by

Koza, J., R.

Literature search on Evolutionary ComputationBBase ©1999-2013, Rasmus K. Ursem
     Home · Search · Adv. search · Authors · Login · Add entries   Webmaster
Note to authors: Please submit your bibliography and contact information - online papers are more frequently cited.

Info: Symposium on Pattern Formation (SPF-93), Claremont, California, USA (Conference proceedings), 1993
Keywords:genetic algorithms, genetic programming
Abstract:
It is difficult to write programs for both Lindenmayer systems [LS] and cellular automata. [CA] This paper demonstrates the possibility of discovering the rewrite rule for Lindenmayer systems [LS] and the state transition rules for cellular automata [CA] by means of genetic programming. Genetic programming [GP] [GP] is an extension of the genetic algorithm [GA] in which computer programs are genetically bred to solve problems. We demonstrate the use of genetic programming to [GP] discover the rewrite rules for a Lindenmayer system [LS] for the quadratic Koch island using a pattern matching measure as the driving force for the evolutionary process. We also demonstrate the use of genetic programming to [GP] discover the state transition rules for a one-dimensional and two-dimensional cellular automata [CA] using entropy as the driving force for the evolutionary process.
Notes:
Presented at
Author(s) DL:Online papers for Koza, J., R.
Internet search:Search Google
Search Google Scholar
Search Citeseer using Google
Search Google for PDF
Search Google Scholar for PDF
Search Citeseer for PDF using Google

Review item:

Mark as doublet (will be reviewed)

Print entry



BibTex:
@InProceedings{koza:1993:LsCA,
  author =       "John R. Koza",
  title =        "Discovery of rewrite rules in Lindenmayer systems and
                 state transition rules in cellular automata via genetic
                 programming",
  booktitle =    "Symposium on Pattern Formation (SPF-93), Claremont,
                 California, USA",
  year =         "1993",
  keywords =     "genetic algorithms, genetic programming",
  abstract =     "It is difficult to write programs for both Lindenmayer
                 systems and cellular automata. This paper demonstrates
                 the possibility of discovering the rewrite rule for
                 Lindenmayer systems and the state transition rules for
                 cellular automata by means of genetic programming.
                 Genetic programming is an extension of the genetic
                 algorithm in which computer programs are genetically
                 bred to solve problems. We demonstrate the use of
                 genetic programming to discover the rewrite rules for a
                 Lindenmayer system for the quadratic Koch island using
                 a pattern matching measure as the driving force for the
                 evolutionary process. We also demonstrate the use of
                 genetic programming to discover the state transition
                 rules for a one-dimensional and two-dimensional
                 cellular automata using entropy as the driving force
                 for the evolutionary process.",
  notes =        "Presented at",
}