Identifying Cellular Automata Rules

Created by W.Langdon from gp-bibliography.bib Revision:1.4020

  author =       "Ken-ichi Maeda and Chiaki Sakama",
  title =        "Identifying Cellular Automata Rules",
  journal =      "Journal of Cellular Automata",
  year =         "2007",
  volume =       "2",
  number =       "1",
  pages =        "1--20",
  keywords =     "genetic algorithms, genetic programming, Cellular
                 automata, identification problem, decision tree",
  bibsource =    "DBLP,",
  URL =          "",
  URL =          "",
  size =         "20 pages",
  abstract =     "This paper studies a method for identifying cellular
                 automata rules (CA rules). Given a sequence of CA
                 configurations, we first seek an appropriate
                 neighbourhood of a cell and collect cellular changes of
                 states as evidences. The collected evidences are then
                 classified using a decision tree, which is used for
                 constructing CA transition rules. Conditions for
                 classifying evidences in a decision tree are computed
                 using genetic programming. We perform experiments using
                 several types of CAs and verify that the proposed
                 method successfully identifies correct CA rules.",

Genetic Programming entries for Ken-ichi Maeda Chiaki Sakama