From linear term rewriting to graph rewriting with preservation of termination

DOI10.4204/eptcs.350.2MaRDI QIDQ6649533

Roy Overbeek, Jörg Endrullis

Publication date: 6 December 2024

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Algebraic approach to single-pushout graph transformation
• The PBPO graph transformation approach
• Graph rewriting and relabeling with PBPO\textsuperscript{+}
• Fundamentals of algebraic graph transformation
• Local termination: theory and practice
• AGREE – Algebraic Graph Rewriting with Controlled Embedding
• Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings
• Sesqui-Pushout Rewriting
• Local Termination
• Patch Graph Rewriting
• Graph Path Orderings
• Proving non-termination by finite automata
• Foundations of Software Science and Computation Structures
• Category Theory

Related Items (2)

Termination of graph transformation systems using weighted subgraph counting ⋮ Fuzzy presheaves are quasitoposes

This page was built for publication: From linear term rewriting to graph rewriting with preservation of termination