scientific article; zbMATH DE number 2087437

MaRDI QIDQ4738232zbMATH OpenFDO

Authors Christof Löding

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2303/23030280.htm

Mathematics Subject Classification ID

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

Recommendations

• Reachability problems on regular ground tree rewriting graphs
• scientific article; zbMATH DE number 1231556
• Rewriting higher-order stack trees
• scientific article; zbMATH DE number 1231502
• Rewriting higher-order stack trees

Cited in

(11)

• Rewriting higher-order stack trees
• Reachability problems on regular ground tree rewriting graphs
• Tree automata for rewrite strategies
• First-order logic with reachability predicates on infinite systems
• Rewriting higher-order stack trees
• The Reachability Problem over Infinite Graphs
• Transition Graphs of Rewriting Systems over Unranked Trees
• scientific article; zbMATH DE number 1231502 (Why is no real title available?)
• scientific article; zbMATH DE number 1231556 (Why is no real title available?)
• Senescent ground tree rewrite systems
• scientific article; zbMATH DE number 2086416 (Why is no real title available?)

This page was built for publication:

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