Advertisement

General solution to a system of recursive equations on hypergraphs

  • Michel Bauderon
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 532)

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.

Keywords

hypergraphs hyperede rewriting systems of equations initial solution general solution 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. References

  1. [Ba89]
    BAUDERON M., On some properties of infinite graphs, Proc. of the WG'88, Amsterdam, Lect. Not. Comp. Sci. 344, Springer Verlag, 1989, 54–73.Google Scholar
  2. [Ba90a]
    BAUDERON M., Infinite hypergraphs: I. Basic Properties, Report 90-20, University Bordeaux I, to appear in Theor. Comp. SciGoogle Scholar
  3. [Ba90b]
    BAUDERON M., Infinite hypergraphs: II. Systems of recursive equations on hypergraphs, revised version to appear in Theor. Comp. Sci.Google Scholar
  4. [BC87]
    BAUDERON M., COURCELLE B., Graph expressions and graph rewritings, Math. Systems Theory 20, 83–127 (1987)CrossRefGoogle Scholar
  5. [Ca88]
    CAUCAL D., Pattern graphs, Research report 441, IRISA, 1988Google Scholar
  6. [Co83]
    COURCELLE B., Fundamental properties of trees, Theor. Comp. Sci. 25 (1983) 95–169CrossRefGoogle Scholar
  7. [Co88]
    COURCELLE B. Definable properties of equational graphs, to appear in Annals of Pure and Applied LogicGoogle Scholar
  8. [Co88c]
    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 1988Google Scholar
  9. [Eh79]
    EHRIG H., Introduction to the algebraic theory of graphs, Lect. Not. Comp. Sci. 73 Springer 1977 1–69Google Scholar
  10. [HA89]
    HABEL A., Hyperedge replacement grammars and language, Thesis, Bremen 1989Google Scholar
  11. [HK87]
    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, 1987Google Scholar
  12. [Mc71]
    McLANE S., Category for the working mathematician, Springer-Verlag 1971Google Scholar
  13. [SP82]
    SMYTH M.B., PLOTKIN G., The category theoretic solution to recursive domain equations, SIAM J. Comput. Vol. 11, No 4 (1982)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Michel Bauderon
    • 1
  1. 1.Laboratoire Bordelais de Recherche en Informatique Unité Associée au C.N.R.S. no 1304 Département Informatique I.U.T. ‘A’Université Bordeaux ITalence Cedex

Personalised recommendations