{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T22:59:10Z","timestamp":1775516350511,"version":"3.50.1"},"reference-count":23,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1982,9,1]],"date-time":"1982-09-01T00:00:00Z","timestamp":399686400000},"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":11277,"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,9]]},"DOI":"10.1016\/0304-3975(82)90036-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"231-251","source":"Crossref","is-referenced-by-count":87,"title":["Monadic Thue systems"],"prefix":"10.1016","volume":"19","author":[{"given":"Ronald V.","family":"Book","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Jantzen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Celia","family":"Wrathall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(82)90036-6_BIB1","series-title":"Formal Language Theory: Perspectives and Open Problems","first-page":"325","article-title":"Pattern matching in strings","author":"Aho","year":"1980"},{"key":"10.1016\/0304-3975(82)90036-6_BIB2","series-title":"Formal Language Theory: Perspectives and Open Problems","first-page":"49","article-title":"Generators of cones and cylinders","author":"Autebert","year":"1980"},{"key":"10.1016\/0304-3975(82)90036-6_BIB3","first-page":"143","article-title":"On formal properties of simple phrase structure grammars","volume":"14","author":"Bar-Hillel","year":"1961","journal-title":"Z. Phonetik, Sprachwissenschaft, und Kommunikationsforschung"},{"key":"10.1016\/0304-3975(82)90036-6_BIB4","unstructured":"M. Benois and Y. Cochet, Congruences quasi-parfaites sur le monoide libre: alg\u00e9bre et combinatorie, manuscript."},{"key":"10.1016\/0304-3975(82)90036-6_BIB5","series-title":"Seminaire d'Informatique Th\u00e9orique","first-page":"123","article-title":"Congruences plus que parfaites et langages alg\u00e9briques","author":"Berstel","year":"1976"},{"key":"10.1016\/0304-3975(82)90036-6_BIB6","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)90036-6_BIB7","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(81)90078-5","article-title":"Testing for the Church\u2013Rosser property","volume":"16","author":"Book","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(82)90036-6_BIB8","article-title":"Sur l'alg\u00e9bricit\u00e9 des classes de certaines congruences d\u00e9finies sur le monoide libre","author":"Cochet","year":"1971","journal-title":"Th\u00e8se 3e cycle"},{"key":"10.1016\/0304-3975(82)90036-6_BIB9","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)90036-6_BIB10","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/S0019-9958(70)80039-0","article-title":"Full AFLs and nested iterated substitution","volume":"16","author":"Greibach","year":"1970","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(82)90036-6_BIB11","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1137\/0202025","article-title":"The hardest context-free language","volume":"2","author":"Greibach","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(82)90036-6_BIB12","first-page":"30","article-title":"Confluent reductions: abstract properties and applications to term rewriting systems","author":"Huet","year":"1977","journal-title":"18th IEEE Symposium on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(82)90036-6_BIB13","series-title":"Formal Language Theory: Perspectives and Open Problems","first-page":"349","article-title":"Equations and rewrite rules","author":"Huet","year":"1980"},{"key":"10.1016\/0304-3975(82)90036-6_BIB14","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)90036-6_BIB15","unstructured":"J. Kr\u00e1l, A modification of substitution theorem and some necessary and sufficient conditions for sets to be context-free, unpublished manuscript."},{"key":"10.1016\/0304-3975(82)90036-6_BIB16","doi-asserted-by":"crossref","first-page":"223","DOI":"10.2307\/1968867","article-title":"On theories with a combinatorial definition of \u201cequivalence\u201d","volume":"43","author":"Newman","year":"1942","journal-title":"Ann. Math."},{"key":"10.1016\/0304-3975(82)90036-6_BIB17","first-page":"221","article-title":"On some families of languages related to the Dyck languages","author":"Nivat","year":"1970","journal-title":"2nd ACM Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(82)90036-6_BIB18","article-title":"Congruences parfaites et quasi-parfaites","author":"Nivat","year":"1971","journal-title":"Seminaire Dubreil"},{"key":"10.1016\/0304-3975(82)90036-6_BIB19","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1145\/1089208.1089210","article-title":"A short survey on the state of the art in matching and unification problems","volume":"13","author":"Raulefs","year":"1979","journal-title":"SIGSAM Bull."},{"key":"10.1016\/0304-3975(82)90036-6_BIB20","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1145\/321738.321750","article-title":"Tree manipulating systems and Church-Rosser systems","volume":"20","author":"Rosen","year":"1973","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(82)90036-6_BIB21","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1137\/0202014","article-title":"How to make arbitrary grammars look like context-free grammars","volume":"2","author":"Savitch","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(82)90036-6_BIB22","first-page":"1","article-title":"Formal languages and power series","author":"Stanat","year":"1971","journal-title":"3rd ACM Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(82)90036-6_BIB23","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/S0019-9958(67)90401-9","article-title":"Partial-algorithm problems for context-free languages","volume":"11","author":"Ullian","year":"1967","journal-title":"Information and Control"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582900366?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582900366?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:55Z","timestamp":1555111615000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397582900366"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,9]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,9]]}},"alternative-id":["0304397582900366"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(82)90036-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1982,9]]}}}