String-rewriting systems
Proving termination with multiset orderings
Communications of the ACM
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Match-Bounded String Rewriting Systems
Applicable Algebra in Engineering, Communication and Computing
Termination of String Rewriting Proved Automatically
Journal of Automated Reasoning
Effective preprocessing in SAT through variable and clause elimination
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Matrix interpretations for proving termination of term rewriting
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
On tree automata that certify termination of left-linear term rewriting systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Termination of string rewriting with matrix interpretations
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
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
Max/plus tree automata for termination of term rewriting
Acta Cybernetica
| Hi-index | 0.00 |
We use weighted finite automata to automatically prove termination of string rewriting. The general scheme is to use a well-founded monotone algebra, constructed from the automaton. The ordering of the algebra depends on the strictness properties of the operations in the weight semi-ring. We obtain a unified treatment of the previously known matrix method and match bound method, where we use (plus, times) and (min, max), respectively, as weights. We obtain a new powerful termination method when choosing (min, plus). Our approach also handles relative termination.