National Institute of Advanced Industrial Science and Technology (AIST)
Research resultsPublications > AIST TODAY > 2004-No.12
AIST TODAYNo.12 Spring 2004


Development of a Graph Automata Model for Self-Replicating Processes


A variety of models of self-replicating processes have been proposed within the framework of two-dimensional cellular automata. They are heavily dependent on or limited by the peculiar properties of the lattice spaces. We introduced a new framework called graph automata to obtain a natural description of complicated spatio-temporal developmental processes such as self-replication. As an illustrative example, a self-replication of Turing machine is shown in a simple and straightforward formulation. Graph automata provide a new tool to approach important scientific problems such as evolution of morphology, and also to give the basis of self-replicating and self-repairing artifacts.

Figure
Self-replicating process of a Turing machine

Relational Information

AIST Today Vol. 4, No.3 (2004) 14



 back