Infinite hypergraphs I. Basic properties
Open Access
- 31 May 1991
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 82 (2) , 177-214
- https://doi.org/10.1016/0304-3975(91)90222-n
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- The monadic second-order logic of graphs IV: definability properties of equational graphsAnnals of Pure and Applied Logic, 1990
- Categories of embeddingsTheoretical Computer Science, 1989
- Graph expressions and graph rewritingsTheory of Computing Systems, 1987
- Continuous monoids and yields of infinite treesRAIRO - Theoretical Informatics and Applications, 1986
- Some fundamental algebraic tools for the semantics of computation: Part 1: Comma Categories, Colimits, Signatures and TheoriesTheoretical Computer Science, 1984
- Some fundamental algebraic tools for the semantics of computation: Part 2: Signed and abstract theoriesTheoretical Computer Science, 1984
- Fundamental properties of infinite treesTheoretical Computer Science, 1983
- An algorithm for the solution of fixed-point equations for infinite wordsRAIRO. Informatique théorique, 1980
- Least fixed point of a functorJournal of Computer and System Sciences, 1979
- Frontiers of infinite treesRAIRO. Informatique théorique, 1978