{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,11,24]],"date-time":"2022-11-24T08:28:46Z","timestamp":1669278526682},"reference-count":14,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1992,10,1]],"date-time":"1992-10-01T00:00:00Z","timestamp":717897600000},"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":7594,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[1992,10]]},"DOI":"10.1016\/0747-7171(92)90012-s","type":"journal-article","created":{"date-parts":[[2004,12,9]],"date-time":"2004-12-09T22:58:50Z","timestamp":1102633130000},"page":"359-369","source":"Crossref","is-referenced-by-count":1,"title":["Some properties of finite special string-rewriting systems"],"prefix":"10.1016","volume":"14","author":[{"given":"Louxin","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0747-7171(92)90012-S_BIB1_1","article-title":"Defining relations and algorithmic problems for groups and semigroups","volume":"85","author":"Adjan","year":"1966"},{"key":"10.1016\/0747-7171(92)90012-S_BIB1_2","article-title":"Defining relations and algorithmic problems for groups and semigroups","volume":"152","author":"Adjan","year":"1967","journal-title":"English version: AMS Transl"},{"key":"10.1016\/0747-7171(92)90012-S_BIB2","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0747-7171(87)80021-4","article-title":"Thue systems as rewriting systems","volume":"3","author":"Book","year":"1987","journal-title":"J. Symbolic Comput"},{"key":"10.1016\/0747-7171(92)90012-S_BIB3","series-title":"Computability and Unsolvability","author":"Davis","year":"1958"},{"key":"10.1016\/0747-7171(92)90012-S_BIB4","series-title":"Semigroups and combinatorial application","author":"Lallement","year":"1979"},{"key":"10.1016\/0747-7171(92)90012-S_BIB5_1","first-page":"285","article-title":"The identity problem for finitely presented semigroups","volume":"171","author":"Makanin","year":"1966","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/0747-7171(92)90012-S_BIB5_2","first-page":"1478","article-title":"The identity problem for finitely presented semigroups","volume":"7","author":"Makanin","year":"1966","journal-title":"English version: Soviet Math. Dokl"},{"key":"10.1016\/0747-7171(92)90012-S_BIB6","first-page":"19","article-title":"The impossibility of algorithms in the theory of associative systems","volume":"77","author":"Markov","year":"1951","journal-title":"Dokl. Akad. Nauk. SSSR"},{"key":"10.1016\/0747-7171(92)90012-S_BIB7","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0012-365X(91)90040-9","article-title":"It is undecidable whether a finite special string-rewriting system presents a group","volume":"98","author":"Narendran","year":"1991","journal-title":"Discrete Math"},{"key":"10.1016\/0747-7171(92)90012-S_BIB8","series-title":"Seminaire Dubreil, 25e Annee","article-title":"Congruences parfaites et quasi-parfaites","author":"Nivat","year":"1971"},{"key":"10.1016\/0747-7171(92)90012-S_BIB9","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0304-3975(83)90039-7","article-title":"Undecidable questions related to Church-Rosser Thue systems","volume":"23","author":"O'Dunlaing","year":"1983","journal-title":"Theoret. Comput. Sci"},{"key":"10.1016\/0747-7171(92)90012-S_BIB10","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0022-0000(87)90017-1","article-title":"On deciding the confluence of a finite string-rewriting system on a given congruence class","volume":"35","author":"Otto","year":"1987","journal-title":"J. Comput. Sys. Sci"},{"key":"10.1016\/0747-7171(92)90012-S_BIB11","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1007\/BF01178585","article-title":"Decision Problems for finite special string-rewriting systems that are confluent on some congruence class","volume":"28","author":"Otto","year":"1991","journal-title":"Acta Inf"},{"key":"10.1016\/0747-7171(92)90012-S_BIB12","doi-asserted-by":"crossref","first-page":"172","DOI":"10.2307\/1969933","article-title":"Recursive unslovability of group theoretic problems","volume":"67","author":"Rabin","year":"1958","journal-title":"Ann. of Math"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074771719290012S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074771719290012S?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:26:46Z","timestamp":1548980806000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074771719290012S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,10]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,10]]}},"alternative-id":["074771719290012S"],"URL":"https:\/\/doi.org\/10.1016\/0747-7171(92)90012-s","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1992,10]]}}}