scientific article; zbMATH DE number 1361503

MaRDI QIDQ4699322zbMATH OpenFDO

Authors Detlef Plump

Publication date 10 November 1999

zbMATH Keywords

term graph rewritingrecursive path order

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

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

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
• Non-simplifying graph rewriting termination
• Relating graph and term rewriting via Böhm models
• Drags: a compositional algebraic framework for graph rewriting
• Relating graph and term rewriting via Böhm models
• Kruskal's tree theorem for acyclic term graphs
• Termination of graph transformation systems using weighted subgraph counting
• 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)