Discovery of rewrite rules in Lindenmayer systems and state transition rules in cellular automata via genetic programming
Created by W.Langdon from
gp-bibliography.bib Revision:1.7964
- @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)",
-
year = "1993",
-
address = "Claremont, California, USA",
-
month = feb,
-
keywords = "genetic algorithms, genetic programming",
-
URL = "http://www.genetic-programming.com/jkpdf/spf1993.pdf",
-
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",
- }
Genetic Programming entries for
John Koza
Citations