Self-description for construction and execution in graph rewriting automata

Kohji Tomita, Satoshi Murata, Akiya Kamimura, Haruhisa Kurokawa

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

6 Citations (Scopus)

Abstract

In this paper, we consider how self-description can be realized for construction and execution in a single framework of a variant of graph rewriting systems, called graph rewriting automata. As an example of self-description for construction, self-replication based on a self-description is shown. A meta-node structure is introduced for self-description for execution that enables us to embed rule sets in the graph structure. It can be a model of systems that maintain and modify themselves.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages705-715
Number of pages11
DOIs
Publication statusPublished - 2005 Dec 1
Externally publishedYes
Event8th European Conference on Advances in Artificial Life, ECAL 2005 - Canterbury, United Kingdom
Duration: 2005 Sep 5 → 2005 Sep 9

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3630 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other8th European Conference on Advances in Artificial Life, ECAL 2005
CountryUnited Kingdom
CityCanterbury
Period05/9/5 → 05/9/9

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Access to Document

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

Cite this