Graph unification and matching

DOI10.1007/3-540-61228-9_80zbMath1412.68115OpenAlexW1577997551MaRDI QIDQ4645268

Detlef Plump, Annegret Habel

Publication date: 10 January 2019

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61228-9_80

zbMATH Keywords

transformation ruleinjective morphismgraph matchmatch problemmatch rule

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Linear Diophantine equations (11D04)

Related Items (3)

Drags: a compositional algebraic framework for graph rewriting ⋮ Unification of drags and confluence of drag rewriting ⋮ Solving Equations by Graph Transformation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hyperedge replacement: grammars and languages
• Efficient solution of linear diophantine equations
• The undecidability of the second-order unification problem
• Linear unification
• Word unification and transformation of generalized equations
• An efficient incremental algorithm for solving systems of linear diophantine equations
• Minimal and complete word unification
• Graph expressions and graph rewritings
• Unification: a multidisciplinary survey
• THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP

This page was built for publication: Graph unification and matching