Automatic Generation of Self-Replicating Patterns in Graph Automata

Graph automata define symbol dynamics on graph structures, which has capability of generating structures in addition to state transition. The rules of the graph automata are uniform, thus suitable for evolutionary computation. In this paper we show that evolutionary computation can be successfully applied to automatic rule generation of selfreplicating patterns on graph automata.

• Type: Journal
• Year: 2006
• Where: IJBC
• Authors: Kohji Tomita, Haruhisa Kurokawa, Satoshi Murata
• Keywords: Evolutionary Computation, Graph Automata, Graph Structures, IJBC 2006