[Submit a comment] [RTALooP home] [Index] [Previous] [Next]

[Postscript] [PDF] [BibTeX Source] [LaTeX Source]

Problem #75

Originator: D. Plump
Date: June 1993

Summary: What sufficient conditions make confluence of general (hyper-)graph rewriting decidable?

In contrast to term rewriting, confluence of general (hyper-)graph rewriting—in the “Berlin approach”—is undecidable, even for terminating systems [Plu93]. What sufficient conditions make confluence decidable?

References

[Plu93]

D. Plump. Hypergraph rewriting: Critical pairs and undecidability of confluence. In M. R. Sleep, M. J. Plasmeijer, and M. C. van Eekelen, editors, Term Graph Rewriting: Theory and Practice, chapter 15. Wiley, 1993. To appear.

[Submit a comment] [RTALooP home] [Index] [Previous] [Next]

[Postscript] [PDF] [BibTeX Source] [LaTeX Source]