Graph automata define symbol dynamics of graph structures, which are capable of generating structures in addition to describing state transition. Rules of the graph automata are uniform and are therefore suitable for evolutionary computation. This paper shows that various self-replications are possible in graph automata, and that evolutionary computation is applicable to automatic rule generation to obtain self-replicating patterns of graph automata.
|Number of pages||8|
|Journal||International Journal of Bifurcation and Chaos in Applied Sciences and Engineering|
|Publication status||Published - 2006|
- Cellular automata
- Evolutionary computation
- Graph automata