Self-description for construction and computation on graph-rewriting automata.
This article shows how self-description can be realized for construction and computation in a single framework of a variant of graph-rewriting systems called graph-rewriting automata. Graph-rewriting automata define symbol dynamics on graphs, in contrast to cellular automata on lattice space. Structural change is possible along with state transition. Self-replication based on a self-description is shown as an example of self-description for construction. This process is performed using a construction arm, which is realized as a subgraph, that executes a program described in the graph structure. In addition, a metanode structure is introduced to embed rule sets in the graph structure as self-description for computation. These are regarded as universal graph-rewriting automata that can serve as a model of systems that maintain themselves through replication and modification.
Tomita
Kohji
K
National Institute of Advanced Industrial Science and Technology (AIST), 1-2-1 Namiki, Tsukuba, Ibaraki 305-8564, Japan. k.tomita@aist.go.jp
Murata
Satoshi
S
Kurokawa
Haruhisa
H
D000465:Algorithms; D003196:Computer Graphics; D003198:Computer Simulation; D012371:Robotics; D012984:Software