Self-description for construction and execution in graph rewriting automata

Authors:
Kohji Tomita;Satoshi Murata;Akiya Kamimura;Haruhisa Kurokawa
Affiliations:
National Institute of Advanced Industrial Science, and Technology (AIST), Tsukuba, Japan;Tokyo Institute of Technology, Yokohama, Japan;National Institute of Advanced Industrial Science, and Technology (AIST), Tsukuba, Japan;National Institute of Advanced Industrial Science, and Technology (AIST), Tsukuba, Japan
Venue:
ECAL'05 Proceedings of the 8th European conference on Advances in Artificial Life
Year:
2005

Citing 6
Cited 3

Handbook of graph grammars and computing by graph transformation: volume I. foundations

Handbook of graph grammars and computing by graph transformation: volume I. foundations
Fifty years of research on self-replication: an overview

Artificial Life - Special issue on self-replication
John von Neumann and the evolutionary growth of complexity: looking backward, looking forward …

Artificial Life - Special issue on the Artificial Life VII: looking backward, looking forward
Reflection and semantics in LISP

POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Universal Self-Replication Using Graph Grammars

ICMENS '04 Proceedings of the 2004 International Conference on MEMS, NANO and Smart Systems
Theory of Self-Reproducing Automata

Theory of Self-Reproducing Automata

Asynchronous graph-rewriting automata and simulation of synchronous execution

ECAL'07 Proceedings of the 9th European conference on Advances in artificial life
Causal graph dynamics

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Causal graph dynamics

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

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.