Confluence problems for trace rewriting systems
Information and Computation
Relative undecidability in term rewriting: II. the confluence hierarchy
Information and Computation
Complexity Results for Confluence Problems
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
On the Confluence of Linear Shallow Term Rewrite Systems
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On the Confluence of Linear Shallow Term Rewrite Systems
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Reachability and confluence are undecidable for flat term rewriting systems
Information Processing Letters
Confluence of right ground term rewriting systems is decidable
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |