{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T12:06:24Z","timestamp":1749125184148},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540614647"},{"type":"electronic","value":"9783540685968"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61464-8_61","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:39:59Z","timestamp":1330292399000},"page":"302-316","source":"Crossref","is-referenced-by-count":9,"title":["On the termination problem for one-rule semi-Thue system"],"prefix":"10.1007","author":[{"given":"G\u00e9raud","family":"S\u00e9nizergues","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"J. Berstel. Transductions and Context-Free Languages. Teubner, 1979.","DOI":"10.1007\/978-3-663-09367-1"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"R.V. Book and F. Otto. String Rewriting Systems. Texts and monographs in Computer Science. Springer-Verlag, 1993.","DOI":"10.1007\/978-1-4613-9771-7"},{"key":"24_CR3","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"no 3","author":"N. Dershowitz","year":"1987","unstructured":"N. Dershowitz. Termination of rewriting. Journal of Symbolic Computation no 3, pages 69\u2013116, 1987.","journal-title":"Journal of Symbolic Computation"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and C. Hoot. Topics in termination. In Proceedings of the 5th RTA, edited by C. Kirchner, pages 198\u2013212. Springer, LNCS 690, 1993.","DOI":"10.1007\/3-540-56868-9_16"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.P. Jouannaud. Rewrite Systems. In Handbook of theoretical computer science, svol.B, Chapter 2, pages 243\u2013320. Elsevier, 1991.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1201\/9781439865699"},{"key":"24_CR7","unstructured":"A. Geser. Relative termination. Report 91-03, Ulmer Informatik-Berichte, Universit\u00e4t Ulm, 1991."},{"key":"24_CR8","unstructured":"W. Kurth. Termination und konfluenz von semi-Thue-systemen mit nur einer regel. Dissertation, Technische Universit\u00e4t Clausthal, 1990."},{"key":"24_CR9","unstructured":"R. McNaughton. The uniform halting problem for one-rule semi-Thue systems. Report 94-18 of Rensselaer Polytechnic Institute, 1994."},{"key":"24_CR10","unstructured":"Y. Matiyasevich and G. S\u00e9nizergues. Decision problems for semi-Thue systems with a few rules. To appear in the proceedings of LICS 96, 1996."},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"M. Pelletier and J. Sakarovitch. Easy multiplications, II. extensions of rational semigroups. Information and Computation, pages 18\u201359, 1990.","DOI":"10.1016\/0890-5401(90)90003-Z"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"J. Sakarovitch. Easy multiplications, I. the realm of kleene's theorem. Information and Computation, pages 173\u2013197, 1987.","DOI":"10.1016\/0890-5401(87)90020-4"},{"key":"24_CR13","unstructured":"G. S\u00e9nizergues. The termination and uniform termination problems for one rule of the form 0p1q \u2192 v. In preparation, preliminary version available by email on request to: ges@labri.u-bordeaux.fr, 1996."},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"H. Zantema and A. Geser. A complete characterisation of termination of 0p1q\u2192 1r0s. In Proceedings RTA95, LNCS 914, pages 41\u201355. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-59200-8_46"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61464-8_61.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:06:31Z","timestamp":1605647191000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61464-8_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614647","9783540685968"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-61464-8_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}