Discovery of cellular automata rules using cases

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2843, Issue , 2003, Pages 360-368

  Maeda, Ken Ichi ^a,b   Sakama, Chiaki ^a  

^a WAKAYAMA UNIVERSITY   (Japan)

^b Hitachi Government Public Corporation System Engineering   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION TREES; GENETIC ALGORITHMS; GENETIC PROGRAMMING; ROBOTS;

ARTIFICIAL SYSTEMS; AUTOMATIC DISCOVERY;

CELLULAR AUTOMATA;

EID: 0242266097     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39644-4_34     Document Type: Article

References (4)

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