Self-description for construction and computation on graph-rewriting automata.

Kohji Tomita, Satoshi Murata, Haruhisa Kurokawa

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)383-396
Number of pages14
JournalArtificial life
Issue number4
Publication statusPublished - 2007
Externally publishedYes

ASJC Scopus subject areas

  • Biochemistry, Genetics and Molecular Biology(all)
  • Artificial Intelligence


Dive into the research topics of 'Self-description for construction and computation on graph-rewriting automata.'. Together they form a unique fingerprint.

Cite this