Term rewriting and all that
Termination of Linear Rewriting Systems (Preliminary Version)
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Decidable Approximations of Sets of Descendants and Sets of Normal Forms
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Approximating Dependency Graphs Using Tree Automata Techniques
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Match-Bounded String Rewriting Systems
Applicable Algebra in Engineering, Communication and Computing
Termination of String Rewriting Proved Automatically
Journal of Automated Reasoning
Termination Proofs for String Rewriting Systems via Inverse Match-Bounds
Journal of Automated Reasoning
On tree automata that certify termination of left-linear term rewriting systems
Information and Computation
AProVE 1.2: automatic termination proofs in the dependency pair framework
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Proving Quadratic Derivational Complexities Using Context Dependent Interpretations
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems
Language and Automata Theory and Applications
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Information and Computation
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
The use of automata techniques to prove the termination of string rewrite systems and left-linear term rewrite systems is advocated by Geser et al. in a recent sequence of papers. We extend their work to non-left-linear rewrite systems. The key to this extension is the introduction of so-called raise rules and the use of tree automata that are not quite deterministic. Furthermore, we present negative solutions to two open problems related to string rewrite systems.