Abstract
The algebraic approach, of graph grammars using homomorphisms and pushout constructions given in /Eh-Pf-Sch 73/ and /Ros 74/ is extended to graphic systems which are graphs in a suitable category K including partial graphs, multigraphs, stochastic and topological graphs. These are useful models in computer science, biology, chemistry, network theory and ecology.
Several new results concerning efficient pushout constructions, pushout complements and enlargements are given in the framework of category theory.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
E. Denert,R. Franck,W. Streng: PLAN2D — Towards a 2-dimensional Programming Language, in Lecture Notes in Comp. Sci. 26, 202–213
H. Ehrig: Graph Grammars: Problems and Results in View of Computer Science Applications, Forschungsbericht 75–21 (1975), Technische Universität Berlin, Fachbereich 20
H. Ehrig,W. Kühnel,H.-J. Kreowski,K.D. Kiermeier: Universal Theory of Automata, Teubner, Stuttgart 1974
H. Ehrig, H.-J. Kreowski: Parallel Graph Grammars, in “Automata, Languages and Developement”, to be published by North-Holland 1975/76
H. Ehrig,M. Pfender, H.-J. Schneider: Graph Grammars, An Algebraic Approach, Proc.IEEE Conf.on Automata and Switching Theory, Iowa City 1973, 167–180
H. Ehrig, B.K. Rosen: A Church-Rosser-Theorem for Graph Grammars, to appear
H. Ehrig, K.W. Tischer: Graph Grammars and Applications to Specialization in Biology,Proc.Conf.Biolog.Mot. Aut.Th., Virginia 1974, extended version in Journ. Comp.Syst.Science 11 (1975)
H. Ehrig, K.W. Tischer:Derivations of Stochastic Graphs, Proc.Intern.Symp.on Uniformly Structured Automata and Logic, Tokyo 1975
H. Hansen: Kategorielle Betrachtungen zu den Sätzen von Jordan-Hölder und Schreier, Diplom-Arbeit FB 3, TU Berlin 1974
H. Herrlich, Strecker: Category Theory, Allyn and Bacon, Boston 1974
S. MacLane: Categories for the Working Mathematician, Springer, New York-Heidelberg-Berlin 1972
T.W. Pratt: Pair Grammars, Graph Languages and String to Graph Translation, Journ.Comput.Syst.Science, 5 (1971), 560–595
Riquet: Graphical Models in Biochemistry, Lecture in Oberwolfach (Tagung Automatentheorie und Formale Sprachen) 1974
B. Rosen: Deriving Graphs from Graphs by Applying a Production, IBM Research Report RC 5163, Dec 1974 to appear in Acta Informatica
H.-J. Schneider: Syntax-Directed Description of Incremental Compilers, Tagungsband 4. GI-Jahrestagung Berlin 1974, Springer Lecture Notes in Computer Science 26, 192–201
H.-J. Schneider,H. Ehrig: Grammars on Partial Graphs, Arbeitsberichte Inst.Mat.Masch.Dat.verarb. Univ. Erlangen, vol 8, No 1 (1975), 64–91, to appear in Acta Informatica
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1976 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Ehrig, H., Kreowski, HJ. (1976). Categorical Approach to Graphic Systems and Graph Grammars. In: Marchesini, G., Mitter, S.K. (eds) Mathematical Systems Theory. Lecture Notes in Economics and Mathematical Systems, vol 131. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-48895-5_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-48895-5_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07798-5
Online ISBN: 978-3-642-48895-5
eBook Packages: Springer Book Archive