Relative undecidability in term rewriting

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1258, Issue , 1997, Pages 150-166

  Geser, Alfons ^a   Middeldorp, Aart ^b   Ohlebusch, Enno ^c   Zantema, Hans ^d  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b UNIVERSITY OF TSUKUBA   (Japan)

^c BIELEFELD UNIVERSITY   (Germany)

^d UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL MECHANICS; RECONFIGURABLE HARDWARE;

TERM REWRITING; TERM REWRITING SYSTEMS; TWO-HIERARCHY; UNDECIDABILITY;

COMPUTER CIRCUITS;

EID: 84958752960     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63172-0_37     Document Type: Conference Paper

References (24)

1. A.-C. Caron, Linear Bounded Automata and Rewrite Systems: Influence of Initial Cbnfiguration on Decision Properties, Proceedings of the 15th Colloquium on Trees in Algebra and Programming, Lecture Notes in Computer Science 493 (1991) 74-89.
2. M. Dauchet, Simulation of Turing Mac/fines by a Regular Rewrite Rule, Theoretical Computer Science 103 (1992) 109-120.
3. N. Dershowitz and J.-P. Jouannaud, Rewrite Systems, in: Handbook of Theoretical Computer Science, Vol. B (ed. J. van Leeuwen), North-HoUand (1990) 243-320.
4. M.C.F. Ferreira, Termination of Term Rewriting: Well-foandedness, Totality, and Transformations, PhD thesis, University of Utrecht, 1995.
5. M.C.F. Ferreira and H. Zantema, Total Termination of Term Rewr/ting, Applicable Algebra in Engineering, Communication and Computing 7 (1996) 133-162.
6. A. Geser, Omega-termination is Undecidable for Totally Terminating Term Rewriting Systems, Journal of Symbolic Computation 23 (1997). To appear.
7. A. Geser, A. Middeldorp, E. Ohlebusch and H. Zantema, Relative undecidability in the termination hierarchy of single rewrite rules, Proceedings of the Colloquium on Trees in Algebra and Programming, Lecture Notes in Computer Science (1997). To appear.
8. G. Huet and D. Lankford, On the Uniform Halting Problem for Term Rewriting Systems, report 283, INRIA (1978).
9. G. Huet, Confluent Reductions: Abstract Properties ans Applications to Term Rewriting Systems, Journal of the ACM 27 (1980) 797-821.
10. G. Huet and D.C. Oppen, Equations and Rewrite Rules: A Survey, in: Formal Language Theory: Perspectives and Open Problems (ed. R. Book), Academic Press (1980) 349-405.
11. J.W. Klop, Term Rewriting Systems, in: Handbook of Logic in Computer Science (eds. S. Abramski, D. Gabbay and T. Maibaum), Volume 2, Oxford University Press (1992) 1-116.
12. D.E. Knuth and P.B. Bendix, Simple Word Problems in Universal Algebras, in: Computational Problems in Abstract Algebra (ed. J. Leech), Pergamon Press (1970) 263-297.
13. M. Kurihara and A. Ohuchi, Modularity of Simple Termination of Term Rewriting Systems, Journal of IPS Japan 31 (1990) 633-642.
14. P. Lescanne, On Termination of One Rule Rewrite Systems, Theoretical Computer Science 132 (1994) 395-401.
15. Y. Matiyasevich and G. Senizergues, Decision Problems for Semi-Thue Systems with a Few Rules. Proceedings of the 11th IEEE Annual Symposium on Logic in Computer Science, New Brunswick, pp. 523-531, 1996.
16. A. Middeldorp and B. Gramfich, Simple Termination is Difficult, Applicable Algebra in Engineering, Communication and Computing 6 (1995) 115-128.
17. A. Middeldorp and H. Zantema, Simple Termination of Rewrite Systems, Theoretical Computer Science 175 (1997) 127-158.
18. D.A. Plaisted, The Undecidability of Self-Embedding for Term Rewriting Systems, Information Processing Letters 20 (1985) 61-64.
19. E. Post, A Variant of a Recursively Unsolvable Problem, Bulletin of the American Mathematical Society 52 (1946) 264-268.
20. A. Rubio, Extension Orderings, Proceedings of the 22nd International Colloquium on Automata, Languages and Programming, Szeged, Lecture Notes in Computer Science 944 (1995) 511-522.
21. H. Zantema, Termination of Term Rewriting: Interpretation and Type Elimination, Journal of Symbolic Computation 17 (1994) 23-50.
22. H. Zantema, Termination of Term Rewriting by Semantic Labelling, Fundamenta Informaticae 24 (1995) 89-105.
23. H. Zantema, Total Termination of Term Rewriting is Undecidable, Journal of Symbolic Computation 20 (1995) 43-60.
24. H. Zantema and A. Geser, Non-Looping Rewriting, Utrecht University, Department of Computer Science, report UU-CS-1996-03 (1996).