Hypergraph Rewriting:

this paper is the completion of non-confluent systems. One could set up a procedure which adds rules to a system until all critical pairs are strongly joinable, where the new rules should preserve the equivalence , generated by ). The hypergraph rewriting systems submitted to such a procedure would have to be terminating, to ensure that strong joinability can be checked. This poses the question of how to test for termination of (hyper)graph rewriting systems, a topic to which apparently very little attention has been paid ye