The Reachability Problem over Infinite Graphs

DOI10.1007/978-3-642-03351-3_2zbMath1248.68390OpenAlexW1887472714MaRDI QIDQ3392937

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

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

Related Items (2)

Dynamical systems in categories ⋮ Shortest Paths in One-Counter Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the regular structure of prefix rewriting
• Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
• The theory of ends, pushdown automata, and second-order logic
• Finite presentations of infinite structures: Automata and interpretations
• Reachability problems on regular ground tree rewriting graphs
• Computing by commuting.
• Transition Graphs of Rewriting Systems over Unranked Trees
• On Bifix Systems and Generalizations
• Communication of Two Stacks and Rewriting
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Concatenation as a basis for arithmetic
• Well-structured transition systems everywhere!

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