Subject
General Computer Science,Theoretical Computer Science
Reference30 articles.
1. Termination of term rewriting using dependency pairs;Arts;Theoretical Computer Science,2000
2. “Term Rewriting and All That”;Badder,1998
3. Sequentiality, monadic second-order logic and tree automata;Comon;Information and Computation,2000
4. Comon, H., M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison and M. Tommasi, Tree automata techniques and applications (1999), draft, available from http://www.grappa.univ-lille3.fr/tata/.
5. Termination of rewriting;Dershowitz;Journal of Symbolic Computation,1987
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Increasing interpretations;Annals of Mathematics and Artificial Intelligence;2009-05
2. Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems;IEICE Transactions on Information and Systems;2009
3. Beyond Dependency Graphs;Automated Deduction – CADE-22;2009
4. Tyrolean termination tool: Techniques and features;Information and Computation;2007-04
5. Mechanizing and Improving Dependency Pairs;Journal of Automated Reasoning;2007-01-10