Pushout-Properties: An analysis of gluing constructions for graphs
From MaRDI portal
Publication:3868784
DOI10.1002/mana.19790910111zbMath0431.68069OpenAlexW1967230567MaRDI QIDQ3868784
Hartmut Ehrig, Hans-Joerg Kreowski
Publication date: 1979
Published in: Mathematische Nachrichten (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/mana.19790910111
category of graphsalgebraic theory of graph grammarsboundary morphismsgluing construction for graphsnonuniversal propertiespushout constructionpushout decomposition
Formal languages and automata (68Q45) Abstract data types; algebraic specification (68Q65) Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30)
Related Items
Another look at parameterization for oder-sorted algebraic specifications, Exponentiable morphisms, partial products and pullback complements, Parallelism and concurrency in high-level replacement systems, Canonical derivations for high-level replacement systems, Graph expressions and graph rewritings, Pullbacks of graph C*-algebras from admissible pushouts of graphs, High-Level Programs and Program Conditions, Locating the contractum in the double pushout approach, Relational graph rewritings, The contractum in algebraic graph rewriting, On categorical graph grammars integrating structural transformations and operations on labels, Algebraic approach to single-pushout graph transformation, Unnamed Item, Triangular Logic of Partial Toposes, Pushout-complements and basic concepts of grammars in toposes, Amalgamation of graph transformations: a synchronization mechanism
Cites Work
