{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:04:03Z","timestamp":1725566643250},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540255963"},{"type":"electronic","value":"9783540320333"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-32033-3_25","type":"book-chapter","created":{"date-parts":[[2010,9,28]],"date-time":"2010-09-28T00:20:02Z","timestamp":1285633202000},"page":"338-352","source":"Crossref","is-referenced-by-count":3,"title":["Termination of Single-Threaded One-Rule Semi-Thue Systems"],"prefix":"10.1007","author":[{"given":"Wojciech","family":"Moczyd\u0142owski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfons","family":"Geser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","series-title":"Texts and Monographs in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-9771-7","volume-title":"String-rewriting systems","author":"R. Book","year":"1993","unstructured":"Book, R., Otto, F.: String-rewriting systems. Texts and Monographs in Computer Science. Springer, New York (1993)"},{"key":"25_CR2","unstructured":"Geser, A.: Is termination decidable for string rewriting with only one rule? Habilitation thesis, Wilhelm-Schickard-Institut, Universit\u00e4t T\u00fcbingen, Germany, 201 pages (January 2002)"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Geser, A., Hofbauer, D., Waldmann, J.: Termination proofs for string rewriting systems via inverse match-bounds. J. Automated Reasoning (2005) (in print)","DOI":"10.1007\/s10817-005-9024-8"},{"issue":"1\/2","key":"25_CR4","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/S0304-3975(00)00367-4","volume":"262","author":"Y. Kobayashi","year":"2001","unstructured":"Kobayashi, Y., Katsura, M., Shikishima-Tsuji, K.: Termination and derivational complexity of confluent one-rule string rewriting systems. Theoretical Computer Science\u00a0262(1\/2), 583\u2013632 (2001)","journal-title":"Theoretical Computer Science"},{"key":"25_CR5","unstructured":"Kurth, W.: Termination und Konfluenz von Semi-Thue-Systemen mit nur einer Regel. Dissertation, Technische Universit\u00e4t Clausthal, Germany (1990)"},{"key":"#cr-split#-25_CR6.1","unstructured":"McNaughton, R.: The uniform halting problem for one-rule Semi-Thue Systems. Technical Report 94-18, Dept. of Computer Science, Rensselaer Polytechnic Institute, Troy, NY (August 1994);"},{"key":"#cr-split#-25_CR6.2","unstructured":"See also, Correction to ???The Uniform Halting Problem for One-rule Semi-Thue Systems???, unpublished paper (August 1996)"},{"key":"#cr-split#-25_CR7.1","unstructured":"McNaughton, R.: Well-behaved derivations in one-rule Semi-Thue Systems. Technical Report 95-15, Dept. of Computer Science, Rensselaer Polytechnic Institute, Troy, NY (November 1995);"},{"key":"#cr-split#-25_CR7.2","unstructured":"See also, Correction by the author to ???Wellbehaved derivations in one-rule Semi-Thue Systems???, unpublished paper (July 1996)"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1023\/A:1010759024900","volume":"26","author":"R. McNaughton","year":"1997","unstructured":"McNaughton, R.: Semi-Thue Systems with an Inhibitor. J. Automated Reasoning\u00a026, 409\u2013431 (1997)","journal-title":"J. Automated Reasoning"},{"key":"25_CR9","unstructured":"Moczyd\u0142owski, W.: Jednoregu\u0142owe systemy przepisywania s\u0142\u00f3w. Masters thesis, Warsaw University, Poland (2002)"},{"key":"25_CR10","unstructured":"Moczyd\u0142owski, W., Geser, A.: Termination of single-threaded onerule Semi-Thue systems. Technical Report TR 02-08 (273), Warsaw University, Available electronically (December 2002), at http:\/\/research.nianet.org\/~geser\/papers\/single.html"},{"key":"25_CR11","series-title":"Intl. Series of Monographs in Pure and Applied Mathematics","volume-title":"Theory of Automata","author":"A. Salomaa","year":"1969","unstructured":"Salomaa, A.: Theory of Automata. Intl. Series of Monographs in Pure and Applied Mathematics, vol.\u00a0100. Pergamon Press, Oxford (1969)"},{"key":"25_CR12","series-title":"London Mathematical Society Lecture Note Series","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1017\/CBO9780511629181.009","volume-title":"Recursion Theory, its Generalisations and Applications","author":"J.V. Tucker","year":"1980","unstructured":"Tucker, J.V.: Computing in algebraic systems. In: Drake, F.F., Wainer, S.S. (eds.) Recursion Theory, its Generalisations and Applications. London Mathematical Society Lecture Note Series, vol.\u00a045, pp. 215\u2013235. Cambridge University Press, Cambridge (1980)"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-32033-3_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:33:59Z","timestamp":1605760439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-32033-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540255963","9783540320333"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-32033-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}