On tree automata that certify termination of left-linear term rewriting systems
Authors:
- Alfons GeserAGAlfons Geser
- Dieter HofbauerDHDieter Hofbauer
- Johannes WaldmannJWJohannes Waldmann
- Hans ZantemaHZHans Zantema
- 1 April 2007
- journal article
- Published by Elsevier in Information and Computation
- Vol. 205 (4) , 512-534
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- 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
- Deleting string rewriting systems preserve regularityTheoretical Computer Science, 2004
- Match-Bounded String Rewriting SystemsApplicable Algebra in Engineering, Communication and Computing, 2004
- Reachability Analysis over Term Rewriting SystemsJournal of Automated Reasoning, 2004
- Decidability for Left-Linear Growing Term Rewriting SystemsInformation and Computation, 2002
- Termination of linear rewriting systemsLecture Notes in Computer Science, 1981