Transition Graphs of Rewriting Systems over Unranked Trees

DOI10.1007/978-3-540-74456-6_8MaRDI QIDQ3525557zbMATH OpenOpenAlexFDO

Authors Christof Löding, Alex Spelten

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

infinite graphsreachabilityrewritingunranked trees

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2086416
• On the regular structure of prefix rewriting
• scientific article; zbMATH DE number 475415
• scientific article; zbMATH DE number 2087437
• On infinite transition graphs having a decidable monadic theory

Cited in

(8)

• The first-order theory of ground tree rewrite graphs
• The Reachability Problem over Infinite Graphs
• Closure of Hedge-Automata Languages by Hedge Rewriting
• Tree Pattern Rewriting Systems
• scientific article; zbMATH DE number 2086416 (Why is no real title available?)
• Regular model checking revisited
• Ramsey quantifiers over automatic structures: complexity and applications to verification
• On the regular structure of prefix rewriting

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

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