2009年6月
On the reachability of a version of graph-rewriting system
INFORMATION PROCESSING LETTERS
- ,
- 巻
- 109
- 号
- 14
- 開始ページ
- 777
- 終了ページ
- 782
- 記述言語
- 英語
- 掲載種別
- 研究論文(学術雑誌)
- DOI
- 10.1016/j.ipl.2009.03.020
- 出版者・発行元
- ELSEVIER SCIENCE BV
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. (C) 2009 Elsevier B.V. All rights reserved.
- リンク情報
- ID情報
-
- DOI : 10.1016/j.ipl.2009.03.020
- ISSN : 0020-0190
- ORCIDのPut Code : 26486926
- Web of Science ID : WOS:000267170300004