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.
CITATION STYLE
Bauderon, M. (1991). General solution to a system of recursive equations on hypergraphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 532 LNCS, pp. 113–126). Springer Verlag. https://doi.org/10.1007/BFb0017385
Mendeley helps you to discover research relevant for your work.