Self-Description for Construction and Computation on Graph-Rewriting Automata

  • Authors:

  • Kohji Tomita;Satoshi Murata;Haruhisa Kurokawa

  • Affiliations:

  • National Institute of Advanced Industrial Science and Technology (AIST), 1-2-1 Namiki, Tsukuba, Ibaraki 305-8564, Japan k.tomita@aist.go.jp;Department of Computational Intelligence and Systems Science, Interdisciplinary Graduate School of Science and Technology, Tokyo Institute of Technology, 4259 Nagatsuda, Midori-ku, Yokohama 226-85 ...;National Institute of Advanced Industrial Science and Technology (AIST), 1-2-1 Namiki, Tsukuba, Ibaraki 305-8564, Japan kurokawa-h@aist.go.jp

  • Venue:
  • Artificial Life
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.