Pushout-complements and basic concepts of grammars in toposes
Theoretical Computer Science
Algebraic transformation of unary partial algebras I. Double-pushout approach
Theoretical Computer Science
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
Pushout Complements for Arbitrary Partial Algebras
TAGT'98 Selected papers from the 6th International Workshop on Theory and Application of Graph Transformations
Introduction to the Algebraic Theory of Graph Grammars (A Survey)
Proceedings of the International Workshop on Graph-Grammars and Their Application to Computer Science and Biology
Pushout complements for partly total algebras
Mathematical Structures in Computer Science
Hi-index | 0.00 |
The double pushout approach to the algebraic graph transformation of hypergraphs was invented 30 years ago and it has been generalized since then to more general objects, like for instance relational systems or total and partial unary algebras. We have recently introduced the double pushout transformation of partial and partly total algebras over an arbitrary signature. In this paper we study the uniqueness condition for these rewriting formalisms, which turns out to be given by a suitable generalization to partial algebras of the well known congruence extension property for total algebras.