Termination of rewriting systems by polynomial interpretations and its implementation
Science of Computer Programming
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Match-Bounded String Rewriting Systems
Applicable Algebra in Engineering, Communication and Computing
A Kleene Theorem for Weighted Tree Automata
Theory of Computing Systems
Peg-solitaire, string rewriting systems and finite automata
Theoretical Computer Science
Deleting string rewriting systems preserve regularity
Theoretical Computer Science - Developments in language theory
Termination Proofs for String Rewriting Systems via Inverse Match-Bounds
Journal of Automated Reasoning
Synthesis of max-plus quasi-interpretations
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
On tree automata that certify termination of left-linear term rewriting systems
Information and Computation
Weighted tree automata and weighted logics
Theoretical Computer Science
Matrix Interpretations for Proving Termination of Term Rewriting
Journal of Automated Reasoning
Limited subsets of a free monoid
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
Arctic Termination ...Below Zero
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Proving termination of rewrite systems using bounds
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Termination by quasi-periodic interpretations
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Certification of proving termination of term rewriting by matrix interpretations
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Weighted automata for proving termination of string rewriting
Journal of Automata, Languages and Combinatorics
Effective preprocessing in SAT through variable and clause elimination
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Termination of string rewriting with matrix interpretations
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
| Hi-index | 0.00 |
We give an overview of applications of weighted finite automata to automatically prove termination of rewriting. Instances of this approach are: standard and arctic matrix interpretations, and the match bound technique. These methods have been developed in recent years, and they are being used by today's leading automated termination prover software.