{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T08:39:30Z","timestamp":1772527170002,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"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":6591,"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,7]]},"DOI":"10.1016\/0304-3975(94)00264-j","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T10:09:04Z","timestamp":1051265344000},"page":"321-329","source":"Crossref","is-referenced-by-count":8,"title":["A finitely presented monoid which has solvable word problem but has no regular complete presentation"],"prefix":"10.1016","volume":"146","author":[{"given":"Yuji","family":"Kobayashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00264-J_bib1","article-title":"Systems of Reductions","volume":"Vol. 277","author":"Benninghofen","year":"1987"},{"key":"10.1016\/0304-3975(94)00264-J_bib2","series-title":"String Rewriting Systems","author":"Book","year":"1993"},{"key":"10.1016\/0304-3975(94)00264-J_bib3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01354525","article-title":"On the Gelfond-Kirillov-dimension","volume":"220","author":"Borho","year":"1976","journal-title":"Math. Ann."},{"key":"10.1016\/0304-3975(94)00264-J_bib4","doi-asserted-by":"crossref","first-page":"3135","DOI":"10.1080\/00927879308824722","article-title":"Growth functions for some one-relator monoids","volume":"21","author":"Brazil","year":"1993","journal-title":"Comm. Algebra"},{"key":"10.1016\/0304-3975(94)00264-J_bib5","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1016\/0021-8693(79)90238-2","article-title":"Presentations of groups and monoids","volume":"57","author":"Gilman","year":"1979","journal-title":"J. Algebra"},{"key":"10.1016\/0304-3975(94)00264-J_bib6","series-title":"Proc. ICM","first-page":"325","article-title":"On growth in group theory","author":"Grigorchuk","year":"1991"},{"key":"10.1016\/0304-3975(94)00264-J_bib7","series-title":"Combinatorial Theory","author":"Hall","year":"1967"},{"key":"10.1016\/0304-3975(94)00264-J_bib8","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0304-3975(85)90023-4","article-title":"A finite Thue system with decidable word problem and without equivalent finite canonical system","volume":"35","author":"Kapur","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00264-J_bib9","doi-asserted-by":"crossref","first-page":"1052","DOI":"10.1137\/0214073","article-title":"The Knuth-Bendix completion procedure and Thue systems","volume":"14","author":"Kapur","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)00264-J_bib10","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0304-3975(83)90060-9","article-title":"Infinite regular Thue systems","volume":"25","author":"O'D\u00fanlaing","year":"1983","journal-title":"Theoret. Computer. Sci."},{"key":"10.1016\/0304-3975(94)00264-J_bib11","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0022-4049(87)90129-0","article-title":"Word problems and homological finiteness condition for monoids","volume":"49","author":"Squier","year":"1987","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1016\/0304-3975(94)00264-J_bib12","series-title":"Rewriting Techniques and Applications","first-page":"74","article-title":"The word problem for finitely presented monoids and finite canonical rewriting systems","volume":"Vol. 256","author":"Squier","year":"1987"},{"key":"10.1016\/0304-3975(94)00264-J_SB0065","first-page":"465","article-title":"A growth criterion for graphs and algebras defined by words","volume":"31","author":"Ufnarovskij","year":"1982","journal-title":"Mat. Zametki"},{"key":"10.1016\/0304-3975(94)00264-J_CE0005","unstructured":"English trans.: Math Notes37, 238\u2013241."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400264J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400264J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T12:28:17Z","timestamp":1555417697000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759400264J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["030439759400264J"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00264-j","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}