Abstract
A terminating term rewriting system is called simply terminating if its termination can be shown by means of a simplification ordering, an ordering with the property that a term is always bigger than its proper subterms. Almost all methods for proving termination yield, when applicable, simple termination. We show that simple termination is an undecidable property, even for one-rule systems. This contradicts a result by Jouannaud and Kirchner. The proof is based on the ingenious construction of Dauchet who showed the undecidability of termination for one-rule systems. Our results may be summarized as follows: being simply terminating, (non-)self-embedding, and (non-)looping are undecidable properties of orthogonal, variable preserving, one-rule constructor systems.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Caron, A.-C.: Linear Bounded Automata and Rewrite Systems: Influence of Initial Configuration on Decision Properties. Proceedings of the Colloquium on Trees in Algebra and Programming, Brighton. Lecture Notes in Computer Science, vol.493, pp. 74–89. Berlin, Heidelberg, New York: Springer 1991
Dauchet, M.: Simulation of Turing Machines by a Regular Rewrite Rule, Theoret. Comput. Sci.103, 409–420, 1992. Previous version in the Proceedings of the 3rd International Conference on Rewriting Techniques and Applications, Chapel Hill, Lecture Notes in Computer Science, vol.355, pp. 109–120, 1989
Dershowitz, N.: Termination of Rewriting. J. Symbolic Comput.3(1), 69–116 (1987)
Dershowitz, N.: Corrigendum: Termination of Rewriting, JSC (1987) 3, 69–116. J. Symbolic Comput.4, 409–410 (1987)
Dershowitz, N., Jouannaud, J.-P.: Rewrite Systems. In: Handbook of Theoretical Computer Science, Vol. B J. van Leeuwen (ed.). Amsterdam: North-Holland, pp. 243–320, 1990
Dershowitz, N., Jouannaud, J.-P., Klop, J.W.: Open Problems in Rewriting. Proceedings of the 4th International Conference on Rewriting Techniques and Applications. Como, Lecture Notes in Computer Science, vol.488, pp. 445–456, 1991
Gramlich, B.: Generalized Sufficient Conditions for Modular Termination of Rewriting. AAECC 1994. (To appear)
Hooper, P.K.: The Undecidability of the Turing Machine Immortality Problem. J. Symb. Logic31(2), 219–234(1966)
Huet, G., Lankford, D.: On the Uniform Halting Problem for Term Rewriting Systems. Report 283, INRIA, 1978
Jouannaud, J.-P., Kirchner, H.: Construction d'un Plus Petit Ordre de Simplification. RAIRO Inf. Théorique18(3), 191–207 (1984) (in French)
Klop, J.W.: Term Rewriting Systems. In: Handbook of Logic in Computer Science, Vol. II Abramsky, S., Gabbay, D., Maibaum, T. (eds.). Oxford University Press, pp. 1–116, 1992
Kurihara, M., Ohuchi, A.: Modularity of Simple Termination of Term Rewriting Systems. J. Inf. Proc. Soc. Jpn31(5), 633–642 (1990)
Kurihara, M., Ohuchi, A.: Modularity of Simple Termination of Term Rewriting Systems with Shared Constructors. Theoret. Comput. Sci.103, 273–282 (1992)
Kurth, W.: Termination und Konfluenz von Semi-Thue-Systems mit nur einer Regel. Ph.D. thesis, Technische Universität Clausthal, 1990 (in German)
Ohlebusch, E.: A Note on Simple Termination of Infinite Term Rewriting Systems. Report nr. 7, Universität Bielefeld, 1992
Plaisted, D.A.: The Undecidability of Self-Embedding for Term Rewriting Systems. Inf. Proc. Lett.20, 61–64 (1985)
Purdom, P.W. Jr.: Detecting Looping Simplifications. Proceedings of the 2nd International Conference on Rewriting Techniques and Applications, Bordeaux. Lecture Notes in Computer Science, vol.256, pp. 54–61. Berlin, Heidelberg, New York: Springer 1987
Zantema, H.: Type Removal in Term Rewriting. Proceedings of the 3rd International Workshop on Conditional Term Rewriting Systems, Pont-á-Mousson. Lecture Notes in Computer Science, vol.656, pp. 148–154. Berlin, Heidelberg, New York: Springer 1993
Zantema, H.: Termination of Term Rewriting by Interpretation. Proceedings of the 3rd International Workshop on Conditional Term Rewriting Systems, Pont-á-Mousson. Lecture Notes in Computer Science, vol.656, pp. 155–167. Berlin, Heidelberg, New York: Springer 1993
Author information
Authors and Affiliations
Additional information
A preliminary version of this paper appeared in the Proceedings of the 5th International Conference on Rewriting Techniques and Applications, Montreal, Lecture Notes in Computer Science 690, pp. 228–242, 1993.
Rights and permissions
About this article
Cite this article
Middeldorp, A., Gramlich, B. Simple termination is difficult. AAECC 6, 115–128 (1995). https://doi.org/10.1007/BF01225647
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01225647