Abstract
A categorical framework has been described in [Ba89] to extend to systems of recursive equations on hypergraphs the classical results available for trees, such as the existence of an initial solution generalizing that of a least solution. As in the case of trees, the solution is not in general unique, but the situation is much more involved for hypergraphs. The aim of this paper is to present a classification of all the solutions of a system of recursive equations on hypergraphs.
This work has been partially supported by the C.N.R.S. PRC "Mathématiques et Informatique" and by the ESPRIT BRA 3299 "Computing with graph transformations".
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
6. References
BAUDERON M., On some properties of infinite graphs, Proc. of the WG'88, Amsterdam, Lect. Not. Comp. Sci. 344, Springer Verlag, 1989, 54–73.
BAUDERON M., Infinite hypergraphs: I. Basic Properties, Report 90-20, University Bordeaux I, to appear in Theor. Comp. Sci
BAUDERON M., Infinite hypergraphs: II. Systems of recursive equations on hypergraphs, revised version to appear in Theor. Comp. Sci.
BAUDERON M., COURCELLE B., Graph expressions and graph rewritings, Math. Systems Theory 20, 83–127 (1987)
CAUCAL D., Pattern graphs, Research report 441, IRISA, 1988
COURCELLE B., Fundamental properties of trees, Theor. Comp. Sci. 25 (1983) 95–169
COURCELLE B. Definable properties of equational graphs, to appear in Annals of Pure and Applied Logic
COURCELLE B., Some applications of logic of universal algebra and of category theory to the theory of graph transformations, Tutorial, Bull. of the EATCS, 36, October 1988
EHRIG H., Introduction to the algebraic theory of graphs, Lect. Not. Comp. Sci. 73 Springer 1977 1–69
HABEL A., Hyperedge replacement grammars and language, Thesis, Bremen 1989
HABEL A., KREOWSKY H-J., Some structural aspects of hypergraph languages generated by hyperedge replacement, Lect. Not. Comp. Sci; 247, 207–219 (1987) and May we introduce to you: hyperedge replacement, Lect Not. Comp. Sci.,291, 15–26, 1987
McLANE S., Category for the working mathematician, Springer-Verlag 1971
SMYTH M.B., PLOTKIN G., The category theoretic solution to recursive domain equations, SIAM J. Comput. Vol. 11, No 4 (1982)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bauderon, M. (1991). General solution to a system of recursive equations on hypergraphs. In: Ehrig, H., Kreowski, HJ., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1990. Lecture Notes in Computer Science, vol 532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017385
Download citation
DOI: https://doi.org/10.1007/BFb0017385
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54478-4
Online ISBN: 978-3-540-38395-6
eBook Packages: Springer Book Archive