On the reachability of a version of graph-rewriting system

DOI10.1016/j.ipl.2009.03.020zbMath1213.68352OpenAlexW2088327801MaRDI QIDQ989484

Kohji Tomita, Haruhisa Kurokawa

Publication date: 20 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.03.020

zbMATH Keywords

cellular automatainterconnection networkgraph automatagraph-rewriting

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Cellular automata (computational aspects) (68Q80) Grammars and rewriting systems (68Q42)

Cites Work

• Graph automata: Natural expression of self-reproduction
• Handbook of Graph Grammars and Computing by Graph Transformation
• Unnamed Item
• Unnamed Item

This page was built for publication: On the reachability of a version of graph-rewriting system