×

Pushout-properties: An analysis of gluing constructions for graphs. (English) Zbl 0431.68069


MSC:

68Q45 Formal languages and automata
68Q65 Abstract data types; algebraic specification
18A30 Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.)
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Ehrig, Conf. Report Algebraic System Theory, Udine 1975, Springer Lecture Notes in Econ Math. Syst. 131 pp 323– (1976)
[2] and , Parallel Graph Grammars, Automata, Languages, Development (eds. and ), North-Holland, Amsterdam 1976, 425–442.
[3] and , Embedding Theorem for Graph-Grammars, in: Forschungsbericht FB 20, Techn. Universität Berlin, Nr. 76–22, 1976.
[4] Ehrig, Proc. Conf. Math. Foundations of Comp. Sci., Gdansk 1976, Springer Lecture Notes in Comp. Sci. 45 pp 284– (1976) · doi:10.1007/3-540-07854-1_188
[5] and , Graphs Grammars: An Algebraic Approach, Proceedings of the IEEE Conf. on Automata and Switching Theory, Iowa City 1973, 167–180.
[6] and , Commutativity of Independent Transformations on Complex Objects, IBM Research Report RC 6251, Oct. 1976. · Zbl 0357.02034
[7] Ehrig, in Journ. Comp. System Science 11 pp 212– (1975)
[8] and , Category Theory, Allyn and Bacon 1973.
[9] Manipulationen von Graphamanipulationen, Dissertation, Technische Universität Berlin, Fachbereich Informatik (1977).
[10] Meisen, Canad. Math. Bull. vol 16 pp 251– (1973) · Zbl 0282.18006 · doi:10.4153/CMB-1973-043-5
[11] Ringel, Journal of Pure and Applied Algebra 2 pp 341– (1972)
[12] Rosen, Acta Informatica 4 pp 337– (1975)
[13] Schneider, Acta Informatica 6 pp 297– (1976)
[14] Arbeitsberichte Inst. Math. Masch. Datenverarb. 8 pp 64– (1975)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.