DOIAbstract
AbstractBasic properties of the category of infinite directed hyperedge-labelled hypergraphs are studied. An algebraic structure is given which enables us to describe such hypergraphs by means of infinite expressions. It is then shown that two expressions define the same hypergraphs if and only if they are congruent with respect to some rewriting system. These results will be used in the second part of this paper to solve systems of recursive equations on hypergraphs and characterize their solutions
Add to ORKG