Self-description for construction and computation on graph-rewriting automata.
In: Artificial life, Jg. 13 (2007-09-01), Heft 4, S. 383-96
academicJournal
Zugriff:
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.
Titel: |
Self-description for construction and computation on graph-rewriting automata.
|
---|---|
Autor/in / Beteiligte Person: | Tomita, K ; Murata, S ; Kurokawa, H |
Zeitschrift: | Artificial life, Jg. 13 (2007-09-01), Heft 4, S. 383-96 |
Veröffentlichung: | Cambridge, MA : MIT Press, c1994-, 2007 |
Medientyp: | academicJournal |
ISSN: | 1064-5462 (print) |
DOI: | 10.1162/artl.2007.13.4.383 |
Schlagwort: |
|
Sonstiges: |
|