{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,17]],"date-time":"2023-04-17T23:10:43Z","timestamp":1681773043637},"reference-count":25,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1995,5,1]],"date-time":"1995-05-01T00:00:00Z","timestamp":799286400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6652,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1995,5]]},"DOI":"10.1016\/0304-3975(94)00278-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:07:16Z","timestamp":1027652836000},"page":"257-276","source":"Crossref","is-referenced-by-count":5,"title":["Some undecidable termination problems for semi-Thue systems"],"prefix":"10.1016","volume":"142","author":[{"given":"G\u00e9raud","family":"S\u00e9nizergues","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00278-9_BIB1","first-page":"94","article-title":"Graph rewriting systems with priorities","volume":"411","author":"Billaud","year":"1989"},{"key":"10.1016\/0304-3975(94)00278-9_BIB2","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0012-365X(84)90177-8","article-title":"Homogeneous Thue systems and the Church\u2014Rosser property","author":"Book","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(94)00278-9_BIB3","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0020-0190(85)90122-X","article-title":"Cancellation rules and extended word problems","volume":"20","author":"Book","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(94)00278-9_BIB4","author":"Book","year":"1993"},{"key":"10.1016\/0304-3975(94)00278-9_BIB5","first-page":"27","article-title":"Embedding into semi-groups with only a few defining relations","author":"Boone","year":"1971"},{"key":"10.1016\/0304-3975(94)00278-9_BIB6_1","doi-asserted-by":"crossref","unstructured":"a V.V. Borisov, Simple examples of groups with unsolvabe word problem, Mat. Zametki 6","DOI":"10.1007\/BF01101402"},{"key":"10.1016\/0304-3975(94)00278-9_BIB6_2","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/BF01101402","article-title":"Simple examples of groups with unsolvabe word problem","volume":"6","author":"Borisov","year":"1969","journal-title":"Math. Notes"},{"key":"10.1016\/0304-3975(94)00278-9_BIB7","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0017142","article-title":"Automata and rational expressions on planar graphs","author":"Bossut","year":"1988"},{"key":"10.1016\/0304-3975(94)00278-9_BIB8","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-53982-4_5","article-title":"Linear bounded automata and rewrite systems: influence of initial configurations on decision properties","author":"Caron","year":"1991"},{"key":"10.1016\/0304-3975(94)00278-9_BIB9","first-page":"172","article-title":"An associative calculus with an insoluble problem of equivalence","volume":"52","author":"Ceitin","year":"1952","journal-title":"Trudy Mat. Inst. Steklov."},{"issue":"4","key":"10.1016\/0304-3975(94)00278-9_BIB10","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1002\/malq.19690152001","article-title":"Word and conjugacy problems in groups with only a few defining relations","volume":"15","author":"Collins","year":"1969","journal-title":"Z. Math. Logik Grundlag. Math."},{"issue":"2","key":"10.1016\/0304-3975(94)00278-9_BIB11","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1215\/ijm\/1256044631","article-title":"A. simple presentation of a group with unsolvable word problem","volume":"30","author":"Collins","year":"1986","journal-title":"Illinois J. Math."},{"key":"10.1016\/0304-3975(94)00278-9_BIB12","first-page":"109","article-title":"Simulation of Turing machines by a left-linear rewrite rule","volume":"355","author":"Dauchet"},{"key":"10.1016\/0304-3975(94)00278-9_BIB13","author":"Davis","year":"1958"},{"key":"10.1016\/0304-3975(94)00278-9_BIB14","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","article-title":"Termination of rewriting","volume":"3","author":"Dershowitz","year":"1987","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0304-3975(94)00278-9_BIB15","first-page":"243","article-title":"Rewrite sysrtems","volume":"B","author":"Dershowitz","year":"1991"},{"issue":"2","key":"10.1016\/0304-3975(94)00278-9_BIB16","doi-asserted-by":"crossref","first-page":"219","DOI":"10.2307\/2269811","article-title":"The undecidability of the Turing machine immortality problem","volume":"31","author":"Hooper","year":"1966","journal-title":"J. Symbolic Logic"},{"issue":"4","key":"10.1016\/0304-3975(94)00278-9_BIB17","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","article-title":"Confluent reductions: abstract properties and applications to term rewriting systems","volume":"27","author":"Huet","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)00278-9_BIB18","author":"Huet","year":"1978","journal-title":"On the uniform halting problem for term rewriting systems"},{"key":"10.1016\/0304-3975(94)00278-9_BIB19","author":"Jantzen","year":"1988"},{"key":"10.1016\/0304-3975(94)00278-9_BIB20","author":"K\u00f6nig","year":"1950","journal-title":"Theorie der Endlichen und Unendlichen Graphen"},{"key":"10.1016\/0304-3975(94)00278-9_BIB21","first-page":"555","article-title":"Simple examples of undecidable associative calculi","author":"Matiyasevich","year":"1967","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0304-3975(94)00278-9_BIB22","first-page":"93","article-title":"Word problem for Thue systems with a few relations","author":"Matiyasevich","year":"1994"},{"key":"10.1016\/0304-3975(94)00278-9_BIB23","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0020-0190(81)90020-X","article-title":"A note on Post's correspondence problem","volume":"12","author":"Pansiot","year":"1981","journal-title":"IPL"},{"key":"10.1016\/0304-3975(94)00278-9_BIB24","author":"Rogers","year":"1967"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594002789?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594002789?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,17]],"date-time":"2023-04-17T22:42:40Z","timestamp":1681771360000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594002789"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,5]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,5]]}},"alternative-id":["0304397594002789"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00278-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,5]]}}}