Abstract
A framework is described in which we can solve equations and systems of equations on oriented edge labelled hypergraphs with a finite sequence of distinguished sources. We show that this cannot be done with the standard order-theoretic methods, but implies the use of some category-theoretic tools and results.
This work has been supported by the C.N.R.S. PRC "Mathematiques et Informatique"
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
7. References
ADAMEK J., KOUBEK V., Least fixed points of a functor, J. Comput. System Sci. 19 (1979) 163–178
BAUDERON M., Infinite hypergraphs, Research Report, Bordeaux, 1988
BAUDERON M., COURCELLE M., Graph expressions and graph rewritings, Math. Systems Theory 20, 83–127 (1987)
CAUCAL D., Pattern graphs, Research report, Rennes 1988
COURCELLE B., Frontiers of infinite trees, RAIRO, Informatique théorique, vol 12, no4, 1978, 319–337
COURCELLE B., Fundamental properties of infinite trees, Theor. Com. Sci. 25 (1983), 95–169.
COURCELLE B., Equivalences and transformations of regular systems. Applications to recursive program schemes and grammars, Theor. Comp. Sci. 42 (1986) 1–122.
COURCELLE B. The monadic 2nd order theory of graphs IV: every equational graph is definable, Research report 8830, Bordeaux 1988
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-2-, 1987
LAMBEK, J., A fixpoint theorem for complete category, Math. Z. 103 (1968), 151–161
LEHMANN D.J., Categories for fixpoint semantics, 17th symposium on Foundations of Computer Science, Houston 1976, 122–126
LEHMANN D.J., SMYTH M.B., Algebraic specification of data types, Math. Systems Theory 14 (1981) 97–139
LINDENMAYER A, Models for multicellular development: characterization, inference and complexity of L-systems, in Trends, techniques and problems in Theoretical Computer Science, Lect. Not. Comp. Sci. 281, 1987, 138–168
MANES E., Algebraic theories, Springer-Verlag 1976
McLANE S., Category for the working mathematician, Springer-Verlag 1971
MULLER D., SCHUPP P, The theory of ends, pushdown automata and second-order logic, Theor. Comp. Sci. 37 (1985) 51–75
PLOTKIN G., SMYTH M.B., The category theoretic solution to recursive domain equations, SIAM J. Comput. Vol. 11, No 4 (1982)
SMYTH M.B., Powerdomains, Journ of Comp. and Syst. Sci., 16, 1978, 23–36
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bauderon, M. (1989). On systems of equations defining infinite graphs. In: van Leeuwen, J. (eds) Graph-Theoretic Concepts in Computer Science. WG 1988. Lecture Notes in Computer Science, vol 344. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50728-0_35
Download citation
DOI: https://doi.org/10.1007/3-540-50728-0_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50728-4
Online ISBN: 978-3-540-46076-3
eBook Packages: Springer Book Archive