Automatic Generation of Self-Replicating Patterns in Graph Automata

摘要

In this paper, we showed that evolutionary computation can be successfully applied to automatic generation of self-replication patterns in graph automata. Many patterns were obtained without complicated definition of the fitness function. More detailed analysis of the properties of self-replication in graph automata is our future work. In addition, we need to extend the framework of graph automata. Self-replication has vast potential application in nano-technology etc., and our methodology can hopefully be applied to such areas.