Discovery of Cellular Automata Rules Using Cases

  • Ken-ichi Maeda
  • Chiaki Sakama
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2843)


Cellular automata (CAs) are used for modeling the problem of adaptation in natural and artificial systems, but it is hard to design CAs having desired behavior. To support the task of designing CAs, this paper proposes a method for automatic discovery of cellular automata rules (CA-rules). Given a sequence of CA configurations, we first collect cellular changes of states as cases. The collected cases are then classified using a decision tree, which is used for constructing CA-rules. Conditions for classifying cases in a decision tree are computed using genetic programming. We perform experiments using several types of CAs and verify that the proposed method successfully finds correct CA-rules.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Adamatzky, A.: Identification of Cellular Automata. Taylor& Francis, London (1994)zbMATHGoogle Scholar
  2. 2.
    Liu, B., Hu, M., Hsu, W.: Intuitive representation of decision trees using general rules and exceptions. In: Proc. AAAI 2000, pp. 615–620. MIT Press, Cambridge (2000)Google Scholar
  3. 3.
    Mitchell, M., Hraber, P.T., Crutchfield, J.P.: Revisiting the edge of chaos: evolving cellular automata to perform computations. Complex Systems 7, 89–130 (1993)zbMATHGoogle Scholar
  4. 4.
    Toffoli, T., Margolous, N.: Cellular Automata Machines. MIT Press, Cambridge (1987)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Ken-ichi Maeda
    • 1
  • Chiaki Sakama
    • 1
  1. 1.Department of Computer and Communication SciencesWakayama University 

Personalised recommendations