Self-description for construction and execution in graph rewriting automata

Kohji Tomita; Satoshi Murata; Akiya Kamimura; Haruhisa Kurokawa

doi:10.1007/11553090_71

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 language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages	705-715
Number of pages	11
DOIs	https://doi.org/10.1007/11553090_71
Publication status	Published - 2005 Dec 1
Externally published	Yes
Event	8th European Conference on Advances in Artificial Life, ECAL 2005 - Canterbury, United Kingdom Duration: 2005 Sep 5 → 2005 Sep 9

Publication series

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

Other

Other	8th European Conference on Advances in Artificial Life, ECAL 2005
Country	United Kingdom
City	Canterbury
Period	05/9/5 → 05/9/9

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/11553090_71

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

Tomita, K., Murata, S., Kamimura, A., & Kurokawa, H. (2005). Self-description for construction and execution in graph rewriting automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 705-715). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3630 LNAI). https://doi.org/10.1007/11553090_71

Self-description for construction and execution in graph rewriting automata. / Tomita, Kohji; Murata, Satoshi; Kamimura, Akiya; Kurokawa, Haruhisa.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2005. p. 705-715 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3630 LNAI).

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

Tomita, K, Murata, S, Kamimura, A & Kurokawa, H 2005, Self-description for construction and execution in graph rewriting automata. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3630 LNAI, pp. 705-715, 8th European Conference on Advances in Artificial Life, ECAL 2005, Canterbury, United Kingdom, 05/9/5. https://doi.org/10.1007/11553090_71

Tomita K, Murata S, Kamimura A, Kurokawa H. Self-description for construction and execution in graph rewriting automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2005. p. 705-715. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/11553090_71

Tomita, Kohji ; Murata, Satoshi ; Kamimura, Akiya ; Kurokawa, Haruhisa. / Self-description for construction and execution in graph rewriting automata. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2005. pp. 705-715 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{4a64ac05e43e4760a95ca495bd23ef5c,

title = "Self-description for construction and execution in graph rewriting automata",

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.",

author = "Kohji Tomita and Satoshi Murata and Akiya Kamimura and Haruhisa Kurokawa",

year = "2005",

month = dec,

day = "1",

doi = "10.1007/11553090_71",

language = "English",

isbn = "3540288481",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "705--715",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

note = "8th European Conference on Advances in Artificial Life, ECAL 2005 ; Conference date: 05-09-2005 Through 09-09-2005",

}

TY - GEN

T1 - Self-description for construction and execution in graph rewriting automata

AU - Tomita, Kohji

AU - Murata, Satoshi

AU - Kamimura, Akiya

AU - Kurokawa, Haruhisa

PY - 2005/12/1

Y1 - 2005/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33646004585&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33646004585&partnerID=8YFLogxK

U2 - 10.1007/11553090_71

DO - 10.1007/11553090_71

M3 - Conference contribution

AN - SCOPUS:33646004585

SN - 3540288481

SN - 9783540288480

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 705

EP - 715

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

T2 - 8th European Conference on Advances in Artificial Life, ECAL 2005

Y2 - 5 September 2005 through 9 September 2005

ER -