The Reachability Problem over Infinite Graphs

DOI10.1007/978-3-642-03351-3_2MaRDI QIDQ3392937zbMATH OpenOpenAlexFDO

Authors Wolfgang Thomas

Publication date 18 August 2009

Published in Computer Science - Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03351-3_2

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Reachability problems on regular ground tree rewriting graphs
• scientific article; zbMATH DE number 2087437
• Finite Automata and the Analysis of Infinite Transition Systems
• On the reachability of a version of graph-rewriting system
• Computer Science Logic

Cites work

• Communication of Two Stacks and Rewriting
• Computing by commuting.
• Concatenation as a basis for arithmetic
• Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
• Finite presentations of infinite structures: Automata and interpretations
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• scientific article; zbMATH DE number 1670780 (Why is no real title available?)
• scientific article; zbMATH DE number 194781 (Why is no real title available?)
• scientific article; zbMATH DE number 1929935 (Why is no real title available?)
• scientific article; zbMATH DE number 2087217 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• On Bifix Systems and Generalizations
• On the regular structure of prefix rewriting
• Reachability problems on regular ground tree rewriting graphs
• The theory of ends, pushdown automata, and second-order logic
• Transition Graphs of Rewriting Systems over Unranked Trees
• Well-structured transition systems everywhere!

Cited in

(5)

• Reachability problems on regular ground tree rewriting graphs
• On reachability in graphs with obstacles
• Dynamical systems in categories
• A logical reconstruction of reachability
• On the reachability of a version of graph-rewriting system

This page was built for publication: The Reachability Problem over Infinite Graphs

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