Abstract
We solve the u-termination and the termination problems for the one-rule semi-Thue systems S of the form 0p1q → v, (p,q ∈ ℕ — {0},v ∈ {0,1}*). We obtain a structure theorem about a monoid that we call the termination-monoid of 5. As a consequence, for every fixed system S of the above form, the termination-problem has a linear time-complexity.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
J. Berstel. Transductions and Context-Free Languages. Teubner, 1979.
R.V. Book and F. Otto. String Rewriting Systems. Texts and monographs in Computer Science. Springer-Verlag, 1993.
N. Dershowitz. Termination of rewriting. Journal of Symbolic Computation no 3, pages 69–116, 1987.
N. Dershowitz and C. Hoot. Topics in termination. In Proceedings of the 5th RTA, edited by C. Kirchner, pages 198–212. Springer, LNCS 690, 1993.
N. Dershowitz and J.P. Jouannaud. Rewrite Systems. In Handbook of theoretical computer science, svol.B, Chapter 2, pages 243–320. Elsevier, 1991.
D.B.A. Epstein, J.W. Cannon, D.F. Holt, S.V.F. Levy, M.S. Paterson, and W.P. Thurston. Word processing in groups. Jones and Bartlett, 1992.
A. Geser. Relative termination. Report 91-03, Ulmer Informatik-Berichte, Universität Ulm, 1991.
W. Kurth. Termination und konfluenz von semi-Thue-systemen mit nur einer regel. Dissertation, Technische Universität Clausthal, 1990.
R. McNaughton. The uniform halting problem for one-rule semi-Thue systems. Report 94-18 of Rensselaer Polytechnic Institute, 1994.
Y. Matiyasevich and G. Sénizergues. Decision problems for semi-Thue systems with a few rules. To appear in the proceedings of LICS 96, 1996.
M. Pelletier and J. Sakarovitch. Easy multiplications, II. extensions of rational semigroups. Information and Computation, pages 18–59, 1990.
J. Sakarovitch. Easy multiplications, I. the realm of kleene's theorem. Information and Computation, pages 173–197, 1987.
G. Sénizergues. The termination and uniform termination problems for one rule of the form 0p1q → v. In preparation, preliminary version available by email on request to: ges@labri.u-bordeaux.fr, 1996.
H. Zantema and A. Geser. A complete characterisation of termination of 0p1q→ 1r0s. In Proceedings RTA95, LNCS 914, pages 41–55. Springer-Verlag, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sénizergues, G. (1996). On the termination problem for one-rule semi-Thue system. In: Ganzinger, H. (eds) Rewriting Techniques and Applications. RTA 1996. Lecture Notes in Computer Science, vol 1103. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61464-8_61
Download citation
DOI: https://doi.org/10.1007/3-540-61464-8_61
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61464-7
Online ISBN: 978-3-540-68596-8
eBook Packages: Springer Book Archive