Self-Description for Construction and Computation on Graph-Rewriting Automata
Self-Description for Construction and Computation on Graph-Rewriting Automata
复制标题
图重写自动机构造与计算的自描述
DOI：
10.1162/artl.2007.13.4.383
复制
发表时间：
2007
期刊：
影响因子：
2.6
通讯作者：
H. Kurokawa
中科院分区：
文献类型：
--
作者：
K. Tomita;S. Murata;H. Kurokawa
本文展示了如何在一个称为图重写自动机的图重写系统变体的单一框架中实现自描述的构造和计算。图重写自动机定义了图上的符号动态，与格空间上的元胞自动机相反。结构变化是可能的沿着状态转换。基于自我描述的自我复制被示出为用于构造的自我描述的示例。该处理使用构造臂来执行，该构造臂被实现为子图，其执行在图结构中描述的程序。此外，引入元节点结构，将规则集嵌入到图结构中，作为计算的自描述。这些被认为是通用的图重写自动机，可以作为系统的模型，通过复制和修改来维护自己。
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.
影响因子：
64.8
作者：
WATSON, JD;CRICK, FHC
通讯作者：
CRICK, FHC