On the reachability of a version of graph-rewriting system

DOI10.1016/J.IPL.2009.03.020zbMATH Open1213.68352OpenAlexW2088327801MaRDI QIDQ989484FDOQ989484

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

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

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)

Cites Work

• Handbook of Graph Grammars and Computing by Graph Transformation
• Title not available (Why is that?)
• Graph automata: Natural expression of self-reproduction
• Title not available (Why is that?)

Cited In (8)

• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• 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)