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

Lecture Notes in Computer Science

Volumn 3467, Issue , 2005, Pages 353-367

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

^a NATIONAL INSTITUTE OF AEROSPACE   (United States)

^b Fb IMN ^*  (Germany)

^c LEIPZIG UNIVERSITY OF APPLIED SCIENCES   (Germany)

^d EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; FINITE ELEMENT METHOD; FORMAL LANGUAGES; ITERATIVE METHODS; LINEAR SYSTEMS; TECHNICAL WRITING;

FINITE SIGNATURES; INFINITE SYSTEMS; TREE AUTOMATA;

AUTOMATA THEORY;

EID: 24944490165     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-32033-3_26     Document Type: Conference Paper

References (20)

1. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
2. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. 1997-2001. Available at http://www.grappa.univ-lille3.fr/tata/.
3. 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, pp. 71-73, Universidad Politécnica de Valencia, Spain
4. N. Dershowitz. Termination of linear rewriting systems. In S. Even and O. Kariv (Eds.), Proc. 8th Int. Coll. Automata, Languages and Programming ICALP-81, Lecture Notes in Comput. Sci. Vol. 115, pp. 448-458. Springer-Verlag, 1981.
5. F. Gécseg and M. Steinby. Tree Languages. In G. Rozenberg and A. Salomaa (Eds.), Handbook of Formal Languages, Vol. 3, pp. 1-68. Springer-Verlag, 1997.
6. 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 Notes in Comput. Sci. Vol. 1379, pp. 151-165. Springer-Verlag, 1998.
7. A. Geser, D. Hofbauer and J. Waldmann. Match-bounded string rewriting systems. Appl. Algebra Engrg. Comm. Comput. 15(3-4):149-171, 2004.
8. A. Geser, D. Hofbauer, J. Waldmann, and H. Zantema. Tree automata that certify termination of term rewriting systems. In M. Codish and A. Middeldorp (Eds.), Proc. 7th Int. Workshop on Termination WST-04, Aachener Informatik Berichte AIB-2004-07, RWTH Aachen, Gemany, pp. 14-17, 2004.
9. A. Geser, D. Hofbauer, J. Waldmann, and H. Zantema. Tree automata that certify termination of left-linear term rewriting systems. 2005. Full version available at http://www.imn.htwk-leipzig.de/~waldmann/pub/rta05/
10. A. Geser, D. Hofbauer, J. Waldmann, and H. Zantema. Finding finite automata that certify termination of string rewriting. In M. Domaratzki, A. Okhotin, K. Salomaa, and S. Yu (Eds.), Proc. 9th Int. Conf. Implementation and Application of Automata CIAA-04, Lecture Notes in Comput. Sci. Vol. 3317, pp. 134-145. Springer-Verlag, 2004.
11. O. Geupel. Overlap closures and termination of term rewriting systems. Technical Report MIP-8922, Universität Passau, Germany, 1989.
12. 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 Comp. Sci. Vol. 3091, pp. 210-220. Springer-Verlag, 2004.
13. N. Hirokawa and A. Middeldorp. Tsukuba Termination Tool. In R. Nieuwenhuis (Ed.), Proc. 14th Int. Conf. Rewriting Techniques and Applications RTA-03, Lecture Notes in Comp. Sci. Vol. 2706, pp. 311-320. Springer-Verlag, 2003.
14. D.S. Lankford and D.R. Musser. A finite termination criterion. Unpublished draft, Information Sciences Institute, University of Southern California, Marina-del-Rey, CA, 1978.
15. C. Marché and A. Rubio (Eds.) Termination Problems Data Base. 2004. http://www.lri.fr/~marche/wst2004-competition/tpdb.html
16. 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.
17. V. van Oostrom and R. de Vrijer. Equivalences of Reductions. In Terese, Term Rewriting Systems, pp. 301-474. Cambridge Univ. Press, 2003.
18. 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 Comp. Sci. Vol. 3091, pp. 85-94. Springer-Verlag, 2004.
19. 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 Comp. Sci. Vol. 3091, pp. 95-104. Springer-Verlag, 2004. Updated version accepted for J. Automat. Reason.
20. H. Zantema. Termination. In Terese, Term Rewriting Systems, pp. 181-259. Cambridge Univ. Press, 2003.