RTA   2005 International Conference on Rewriting Techniques and Applications
Wall of Fame | Most Viewed RTA-2005 Paper
10 years 10 months ago
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, ...
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source197
2Download preprint from source172
3Download preprint from source137
4Download preprint from source129
5Download preprint from source128
6Download preprint from source128
7Download preprint from source126
8Download preprint from source125
9Download preprint from source121
10Download preprint from source121
11Download preprint from source120
12Download preprint from source117
13Download preprint from source111
14Download preprint from source110
15Download preprint from source96
16Download preprint from source95
17Download preprint from source93
18Download preprint from source87
19Download preprint from source81
20Download preprint from source79