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
On the Connections between Rewriting and Formal Language Theory
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Intersection of finitely generated congruences over term algebra
Theoretical Computer Science
Term rewriting restricted to ground terms
Theoretical Computer Science
Note: on ground tree transformations and congruences induced by tree automata
Theoretical Computer Science
Reachability and confluence are undecidable for flat term rewriting systems
Information Processing Letters
Classes of term rewrite systems with polynomial confluence problems
ACM Transactions on Computational Logic (TOCL)
A new decidability technique for ground term rewriting systems with applications
ACM Transactions on Computational Logic (TOCL)
Algorithms and Reductions for Rewriting Problems
Fundamenta Informaticae
Undecidable Properties on Length-Two String Rewriting Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
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
The confluence problem for flat TRSs
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
Processes, Terms and Cycles
Algorithms and Reductions for Rewriting Problems
Fundamenta Informaticae
New Undecidability Results for Properties of Term Rewrite Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 5.24 |