Match-bounds revisited
- 1 November 2009
- journal article
- Published by Elsevier in Information and Computation
- Vol. 207 (11) , 1259-1283
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On tree automata that certify termination of left-linear term rewriting systemsInformation and Computation, 2007
- Tyrolean termination tool: Techniques and featuresInformation and Computation, 2007
- Mechanizing and Improving Dependency PairsJournal of Automated Reasoning, 2007
- Termination of String Rewriting Proved AutomaticallyJournal of Automated Reasoning, 2005
- FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMSInternational Journal of Foundations of Computer Science, 2005
- Termination Proofs for String Rewriting Systems via Inverse Match-BoundsJournal of Automated Reasoning, 2005
- Match-Bounded String Rewriting SystemsApplicable Algebra in Engineering, Communication and Computing, 2004
- Decidability for Left-Linear Growing Term Rewriting SystemsInformation and Computation, 2002
- Termination of term rewriting using dependency pairsTheoretical Computer Science, 2000
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982