Reachability problems on regular ground tree rewriting graphs

DOI10.1007/s00224-004-1170-6zbMath1101.68049OpenAlexW2042752581MaRDI QIDQ2432538

Christof Löding

Publication date: 25 October 2006

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-004-1170-6

Mathematics Subject Classification ID

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

Related Items

On Probabilistic Parallel Programs with Process Creation and Synchronisation ⋮ Reachability on prefix-recognizable graphs ⋮ Decidable models of integer-manipulating programs with recursive parallelism ⋮ The Reachability Problem over Infinite Graphs ⋮ Model Checking FO(R) over One-Counter Processes and beyond ⋮ Automata on finite trees