On the reachability of a version of graph-rewriting system

DOI10.1016/J.IPL.2009.03.020MaRDI QIDQ989484zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• The Reachability Problem over Infinite Graphs
• On graph rewritings
• Set-theoretic graph rewriting
• Reachability problems on regular ground tree rewriting graphs
• On ``On graph rewritings

Cites work

• scientific article; zbMATH DE number 4079227 (Why is no real title available?)
• scientific article; zbMATH DE number 48028 (Why is no real title available?)
• Graph automata: Natural expression of self-reproduction
• Handbook of Graph Grammars and Computing by Graph Transformation

Cited in

(8)

• scientific article; zbMATH DE number 7344705 (Why is no real title available?)
• Attacking the Dimensionality Problem of Parameterized Systems via Bounded Reachability Graphs
• Comparison of two graph-rewrite systems
• On the Decidability Status of Reachability and Coverability in Graph Transformation Systems
• scientific article; zbMATH DE number 1231489 (Why is no real title available?)
• The Reachability Problem over Infinite Graphs
• A Completion Method to Decide Reachability in Rewrite Systems
• Reachability in graph transformation systems and slice languages

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989484)