On tree automata that certify termination of left-linear term rewriting systems

Information and Computation

Volumn 205, Issue 4, 2007, Pages 512-534

  Geser, Alfons ^a   Hofbauer, Dieter ^b   Waldmann, Johannes ^a   Zantema, Hans ^c  

^a LEIPZIG UNIVERSITY OF APPLIED SCIENCES   (Germany)

^b Fachbereich IMN ^*  (Germany)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Forward closures; Rewrite labellings; Term rewriting systems; Termination; Tree automata

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL MECHANICS; FORESTRY; FORMAL LANGUAGES; LINEAR SYSTEMS;

FORWARD CLOSURES; REWRITE LABELLINGS; TERM REWRITING SYSTEMS; TERMINATION; TREE AUTOMATA;

ITERATIVE METHODS;

EID: 84855191249     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2006.08.007     Document Type: Article

References (25)

1. F. Baader, T. Nipkow, Term Rewriting and All That, Cambridge University Press, Cambridge, 1998.
2. H. Barendregt, The Lambda Calculus: its Syntax and Semantics, North Holland, 1984.
3. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, M. Tommasi, Tree automata techniques and applications, 1997-2001, Available at http://www.grappa.univ-lille3.fr/tata/.
4. E. Contejean, C. Marché, B. Monate, and X. Urbain, Proving Termination of Rewriting with CiME, in: A. Rubio (Ed.), Proc. 6th Int. Workshop on Termination WST-03, Technical Report DSIC II/15/03, Universidad Politécnica de Valencia, Spain, 2003, pp. 71-73.
5. N. Dershowitz, Termination of linear rewriting systems, in: S. Even and O. Kariv (Eds.), in: Proc. 8th Int. Coll. Automata, Languages and Programming ICALP-81, Lecture Notes in Comput. Sci. vol. 115, Springer-Verlag, 1981, pp. 448-458.
6. G. Feuillade, T. Genet, V. Viet Triem Tong, Reachability analysis over term rewriting systems, J. Automat. Reason. 33 (3-4) (2004) 341-383. (Pubitemid 40400719)
7. F. Gécseg, M. Steinby, Tree languages, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, vol. 3, Springer-Verlag, Berlin, 1997, pp. 1-68.
8. T. Genet, Decidable approximations of sets of descendants and sets of normal forms, in: T. Nipkow (Ed.), Proc. 9th Int. Conf. Rewriting Techniques and Applications RTA-98, Lecture Notesin Comput. Sci. Vol. 1379, Springer-Verlag, 1998, pp. 151-165. (Pubitemid 128054452)
9. A. Geser, D. Hofbauer, J. Waldmann, Match-bounded string rewriting systems, Appl. Algebra Eng. Commun. Comput. 15 (3-4) (2004) 149-171.
10. A. Geser, D. Hofbauer, J. Waldmann, and H. Zantema, Tree automata that certify termination of term rewriting systems, in: J. Giesl (Ed.), Proc. 16th Int. Conf. Rewriting Techniques and Applications RTA-05, Lecture Notes in Comput. Sci. Vol. 3467, Springer-Verlag, 2005, pp. 353-367. (Pubitemid 41313368)
11. A. Geser, D. Hofbauer, J. Waldmann, H. Zantema, Finding finite automata that certify termination of string rewriting, Internat. J. Found. Comput. Sci. 16(3) (2005) 471-486. (Pubitemid 44099434)
12. O. Geupel, Overlap closures and termination of term rewriting systems, Technical Report MIP-8922, Universität Passau, Germany, 1989.
13. J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke, Automated termination proofs with AProVE, in: V. van Oostrom (Ed.), Proc. 15th Int. Conf. Rewriting Techniques and Applications RTA-04, Lecture Notes in Comput. Sci. Vol. 3091, Springer-Verlag, 2004, pp. 210-220.
14. N. Hirokawa and A. Middeldorp, Tyrolean Termination Tool, in J. Giesl (Ed.), Proc. 16th Int. Conf. Rewriting Techniques and Applications RTA-05, Lecture Notes in Comput. Sci. Vol. 3467, Springer-Verlag, 2005, pp. 175-184. (Pubitemid 41313356)
15. D. Hofbauer, J. Waldmann, Deleting string rewriting systems preserve regularity, Theoret. Comput. Sci. 327(3) (2004) 301-317.
16. D. S. Lankford, D. R. Musser, A finite termination criterion, Unpublished draft, Information Sciences Institute, University of Southern California, Marina-del-Rey, CA, 1978.
17. A. Middeldorp, Approximations for strategies and termination, in: Proc. 2nd Int. Workshop on Reduction Strategies in Rewriting and Programming, Electron. Notes Theor. Comput. Sci. 70(6), 2002.
18. T. Nagaya, Y. Toyama, Decidability for left-linear growing term rewriting systems, Inform. Comput. 178(2) (2002) 499-514. (Pubitemid 35369813)
19. V. van Oostrom, R. de Vrijer, Equivalences of reductions, in: Terese (Eds.), Term Rewriting Systems Cambridge University Press, Cambridge, 2003 pp. 301-474.
20. B. Ravikumar, Peg-solitaire, string rewriting systems and finite automata, in: H.-W. Leong, H. Imai, S. Jain (Eds.), Proc. 8th Int. Symp. Algorithms and Computation ISAAC-97, Lecture Notes in Comput. Sci. vol. 1350, Springer-Verlag, 1997, pp. 233-242. (Pubitemid 128009949)
21. The Termination Problems Data Base, Version 2.0. 2005. http://www.lri.fr/~marche/tpdb/.
22. J. Waldmann, Matchbox: a tool for match-bounded string rewriting, in: V. van Oostrom (Ed.), Proc. 15th Int. Conf. Rewriting Techniques and Applications RTA-04, Lecture Notes in Comput. Sci. vol. 3091, Springer-Verlag, 2004, pp. 85-94.
23. H. Zantema, TORPA: Termination of rewriting proved automatically, in: V. van Oostrom (Ed.), Proc. 15th Int. Conf. Rewriting Techniques and Applications RTA-04, Lecture Notes in Comput. Sci. vol. 3091, Springer-Verlag, 2004, pp. 95-104.
24. H. Zantema, Termination, in: Terese (Eds.), Term Rewriting Systemsm Cambridge University Press, Cambridge, 2003, pp. 181-259.
25. H. Zantema, Termination of string rewriting proved automatically, J. Automat. Reason. 34(2) (2005) 105-139.