{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T22:59:13Z","timestamp":1775516353531,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1982,6,1]],"date-time":"1982-06-01T00:00:00Z","timestamp":391737600000},"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":11369,"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":[[1982,6]]},"DOI":"10.1016\/0304-3975(82)90072-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"325-331","source":"Crossref","is-referenced-by-count":16,"title":["When is a monoid a group? the Church-Rosser case is tractable"],"prefix":"10.1016","volume":"18","author":[{"given":"Ronald V.","family":"Book","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(82)90072-X_BIB1","article-title":"Defining relations and algorithmic problems for groups and semigroups","volume":"85","author":"Adjan","year":"1966","journal-title":"Proc. Steklov Inst. Math."},{"key":"10.1016\/0304-3975(82)90072-X_BIB2","series-title":"Seminaire d'Informatique Th\u00e9orique","first-page":"123","article-title":"Congruences plus que parfaites et languages alg\u00e9brique","author":"Berstel","year":"1976"},{"key":"10.1016\/0304-3975(82)90072-X_BIB3","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1145\/322290.322301","article-title":"Confluent and other types of Thue systems","volume":"29","author":"Book","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(82)90072-X_BIB4","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(82)90036-6","article-title":"Monadic Thue systems","volume":"19","author":"Book","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(82)90072-X_BIB5","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(81)90078-5","article-title":"Testing for the Church-Rosser property","volume":"16","author":"Book","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(82)90072-X_BIB6","article-title":"Sur l'alg\u00e9bricit\u00e9 des classes de certaines congruences sur le monoide libre","author":"Cochet","year":"1971","journal-title":"Th\u00e8se 3e cycle"},{"key":"10.1016\/0304-3975(82)90072-X_BIB7","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/BF02771689","article-title":"Une g\u00e9neralization des ensembles de Dyck","volume":"9","author":"Cochet","year":"1971","journal-title":"Israel J. Math."},{"key":"10.1016\/0304-3975(82)90072-X_BIB8","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(82)90072-X_BIB9","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(82)90072-X_BIB10","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(82)90072-X_BIB11","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0304-3975(81)90031-1","article-title":"On a special monoid with a single defining relation","volume":"16","author":"Jantzen","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(82)90072-X_BIB12","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(76)90068-2","article-title":"Complete problems for deterministic polynomial time","volume":"3","author":"Jones","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(82)90072-X_BIB13","first-page":"221","article-title":"On some families of languages related to the Dyck languages","author":"Nivat","year":"1970","journal-title":"Proc. 2nd ACM Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(82)90072-X_BIB14","series-title":"Ph.D. dissertation","article-title":"Finite and Infinite Regular Thue Systems","author":"\u00d3'D\u00fanlaing","year":"1981"},{"key":"10.1016\/0304-3975(82)90072-X_BIB15","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1145\/321738.321750","article-title":"Tree-manipulating systems and Church-Rosser systems","volume":"20","author":"Rosen","year":"1973","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758290072X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758290072X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:26:26Z","timestamp":1555111586000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439758290072X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,6]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,6]]}},"alternative-id":["030439758290072X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(82)90072-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1982,6]]}}}