{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T12:22:24Z","timestamp":1648902144245},"reference-count":7,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"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":5433,"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":[[1998,9]]},"DOI":"10.1016\/s0304-3975(98)00038-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:48:18Z","timestamp":1027644498000},"page":"169-182","source":"Crossref","is-referenced-by-count":0,"title":["The finiteness of finitely presented monoids"],"prefix":"10.1016","volume":"204","author":[{"given":"Robert","family":"McNaughton","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00038-3_BIB1","series-title":"String-rewriting Systems","author":"Book","year":"1993"},{"key":"10.1016\/S0304-3975(98)00038-3_BIB2","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\/S0304-3975(98)00038-3_BIB3","series-title":"Computational Problems in Abstract Algebras","first-page":"263","article-title":"Simple word problems in universal algebras","author":"Knuth","year":"1970"},{"key":"10.1016\/S0304-3975(98)00038-3_BIB4_1","doi-asserted-by":"crossref","first-page":"509","DOI":"10.4153\/CJM-1964-052-3","article-title":"An algorithmic solution for a word problem in group theory","volume":"16","author":"Mendelsohn","year":"1964","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0304-3975(98)00038-3_BIB4_2","doi-asserted-by":"crossref","first-page":"505","DOI":"10.4153\/CJM-1965-050-4","article-title":"Correction","volume":"17","author":"Mendelsohn","year":"1965","journal-title":"Canad. J. Math"},{"key":"10.1016\/S0304-3975(98)00038-3_BIB5","series-title":"Computation with Finitely Presented Groups","author":"Sims","year":"1994"},{"key":"10.1016\/S0304-3975(98)00038-3_BIB6","first-page":"26","article-title":"A practical method for enumerating cosets of a finite abstract group","volume":"5","author":"Todd","year":"1936"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000383?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000383?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T13:01:44Z","timestamp":1555419704000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598000383"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":7,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,9]]}},"alternative-id":["S0304397598000383"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00038-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,9]]}}}