Transition Graphs of Rewriting Systems over Unranked Trees

DOI10.1007/978-3-540-74456-6_8zbMath1147.68546OpenAlexW1574977252MaRDI QIDQ3525557

Alex Spelten, Christof Löding

Publication date: 17 September 2008

Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.132.9878

zbMATH Keywords

reachabilityrewritinginfinite graphsunranked trees

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42)

Related Items (3)

Regular model checking revisited ⋮ Tree Pattern Rewriting Systems ⋮ The Reachability Problem over Infinite Graphs

This page was built for publication: Transition Graphs of Rewriting Systems over Unranked Trees