scientific article; zbMATH DE number 1361503

zbMATH Open0941.68068MaRDI QIDQ4699322FDOQ4699322

Authors: Detlef Plump 

Publication date: 10 November 1999

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

Recommendations

• Modularity of termination in term graph rewriting
• Essentials of term graph rewriting
• scientific article; zbMATH DE number 177461
• Graph reducibility of term rewriting systems

zbMATH Keywords

term graph rewritingrecursive path order

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited In (14)

• Critical pairs in term graph rewriting
• GETGRATS: a summary of scientific results (with annotated bibliography)
• Essentials of term graph rewriting
• Graph path orderings
• Complexity of acyclic term graph rewriting
• Graph reducibility of term rewriting systems
• Term graph rewriting
• Relating graph and term rewriting via Böhm models
• Non-simplifying graph rewriting termination
• Drags: a compositional algebraic framework for graph rewriting
• Relating graph and term rewriting via Böhm models
• Termination of graph transformation systems using weighted subgraph counting
• Kruskal's tree theorem for acyclic term graphs
• On termination of graph rewriting

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 Q4699322)