Abstract
A semi-Thue system with an inhibitor is one having a special symbol, called an inhibitor, that appears on the right side of every rule but does not appear on the left side of any rule. The main result of this paper is that the uniform halting problem is decidable for the class of such systems. The concept of inhibitor is related to the concept of well-behaved derivation in systems without an inhibitor. The latter concept has received some attention from those interested in the open question as to whether the uniform termination problem for one-rule semi-Thue systems is decidable.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Book, R. V. and Otto, F.: String-rewriting Systems, Springer-Verlag, 1993.
Chomsky, N.: Three models for the description of language, IRE Trans. Inform. Theory IT2 (1956), 113–124.
Davis, M. D., Sigal, R. and Weyuker, E. J.: Computability, Complexity, and Languages, Academic Press, 1994.
Dershowitz, N.: Termination of rewriting, J. Symbolic Comput. 3 (1987), 69–115; 4 (1987), 409–410.
Dershowitz, N. and Hoot, C.: Topics in termination, in C. Kirchner (ed.), Rewriting Techniques and Applications, Lecture Notes in Comput. Sci. 690, Springer-Verlag, 1993.
Guttag, J. V., Kapur, D. and Musser, D. R.: On proving uniform termination and restricted termination of rewriting systems, SIAM J. Comput. 12 (1983), 189–214.
Jantzen, M.: Confluent String Rewriting, Monographs Theoret. Comput. Sci. 14, Springer-Verlag, 1988.
Kobayashi, Y., Katsura, M. and Shikishima-Tsuji, K.: Termination and derivational complexity of confluent one-rule string-rewriting systems, Technical Report, Department of Information Science, Toho University, Funabashi 274, Japan, 1998.
Kurth, W.: Termination und Konfluenz von Semi-Thue-Systemen mit nur einer Regel, Dissertation, Technische Universität Clausthal, 1990.
Kurth, W.: Explanations to the text, Unpublished paper of five pages distributed by the author, summarizing [9].
Kurth, W.: One-rule semi-Thue systems with loops of length one, two or three, Inform. Théor. Appl. 30 (1996), 415–429.
McNaughton, R.: The development of formal language theory since 1956, Internat. J. Found. Comput. Sci. I (1990), 355–368.
McNaughton, R.: The uniform halting problem for one-rule semi-Thue systems: Progress report, Report 94–18, Department of Computer Science, Rensselaer Polytechnic Institute, 1994.
McNaughton, R.: Well behaved derivations in one-rule semi-Thue systems, Report 95–15, Department of Computer Science, Rensselaer Polytechnic Institute, 1995.
Sénizergues, G.: On the termination problem for one-rule semi-Thue systems, in: Proceedings of R.T.A. 96, Lecture Notes in Comput. Sci. 1103, 1996, pp. 302–316.
Thue, A.: Probleme über Veränderungen von Zeichenreihen nach gegebenen Regeln, Skr. Vid. Kristiania, I. Mat. Naturw. Klasse, No. 10 (1914).
Zantema, H. and Geser, A.: A complete characterization of termination of 0p1q ? 1r 0s., in J. Hsiang (ed.), Proceedings of the 6th Conference on Rewriting Techniques and Applications of 1995, Lecture Notes in Comput. Sci. 914, Springer-Verlag, 1955, pp. 41–55.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
McNaughton, R. Semi-Thue Systems with an Inhibitor. Journal of Automated Reasoning 26, 409–431 (2001). https://doi.org/10.1023/A:1010759024900
Issue Date:
DOI: https://doi.org/10.1023/A:1010759024900