scientific article; zbMATH DE number 2087437

zbMATH Open1077.68694MaRDI QIDQ4738232FDOQ4738232

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

Title of this publication is not available (Why is that?)

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

Mathematics Subject Classification ID

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

Cited In (9)

• First-order logic with reachability predicates on infinite systems
• Transition Graphs of Rewriting Systems over Unranked Trees
• Reachability problems on regular ground tree rewriting graphs
• The Reachability Problem over Infinite Graphs
• Tree automata for rewrite strategies
• Rewriting higher-order stack trees
• Rewriting higher-order stack trees
• Title not available (Why is that?)
• Senescent ground tree rewrite systems

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)