On the reachability of a version of graph-rewriting system

Authors:
Kohji Tomita;Haruhisa Kurokawa
Affiliations:
National Institute of Advanced Industrial Science and Technology (AIST), 1-2-1 Namiki, Tsukuba 305-8564, Japan;National Institute of Advanced Industrial Science and Technology (AIST), 1-2-1 Namiki, Tsukuba 305-8564, Japan
Venue:
Information Processing Letters
Year:
2009

Citing 5
Cited 0

The algorithmic beauty of plants

The algorithmic beauty of plants
Handbook of graph grammars and computing by graph transformation: volume I. foundations

Handbook of graph grammars and computing by graph transformation: volume I. foundations
Theory of Self-Reproducing Automata

Theory of Self-Reproducing Automata
From Machine and Tape to Structure and Function: Formulation of a Reflexively Computing System

Artificial Life
Self-Description for Construction and Computation on Graph-Rewriting Automata

Artificial Life

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper, we consider a problem on the reachability of a version of graph-rewriting system. It deals with 3-regular graphs with states for the vertices. They differ from ordinary graphs so that a cyclic order of the edges is assigned on each vertex. Graphs are rewritten with a rule set of graph rewriting. For any two such connected graphs with at least four vertices of distinct states, we show that there exists a rule set that rewrites one to the other.