{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T22:59:16Z","timestamp":1775516356589,"version":"3.50.1"},"reference-count":9,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO. Inform. th\u00e9or."],"published-print":{"date-parts":[[1984]]},"DOI":"10.1051\/ita\/1984180100471","type":"journal-article","created":{"date-parts":[[2017,2,6]],"date-time":"2017-02-06T15:37:20Z","timestamp":1486395440000},"page":"47-52","source":"Crossref","is-referenced-by-count":12,"title":["On expressing commutativity by finite Church-Rosser presentations : a note on commutative monoids"],"prefix":"10.1051","volume":"18","author":[{"given":"J\u00fcrgen","family":"Avenhaus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronald V.","family":"Book","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Craig C.","family":"Squier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"1. BALLANTYNE A. M. and LANKFORD D. S., New Decision Algorithms for Finitely Presented Commutative Semigroups, Computation and Mathematics with Applications, Vol. 7, 1981, pp. 159-165.6197580449.20059","DOI":"10.1016\/0898-1221(81)90115-2"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"2. BOOK R., Decidable Sentences of Church-Rosser Congruences, Theoret. Comput. Sc., Vol. 24, 1983, pp. 301-312.7168260525.68015","DOI":"10.1016\/0304-3975(83)90005-1"},{"key":"R3","unstructured":"3. COCHET Y., Church-Rosser Congruences on Free Semigroups, Colloquia Math. Soc. Janos Bolyai, Vol. 20, 1976, pp. 51-60.5411090408.20054"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"4. COCHET Y. and NIVAT M., Une generalisation des ensembles de Dyck, Isra\u00ebl J. Math., Vol. 9, 1971, pp. 389-395.2760210215.56005","DOI":"10.1007\/BF02771689"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"5. EILENBERG S. and SCHUTZENBERGER M. P., Rational Sets in Commutative Monoids, J. Algebra, Vol. 13, 1969, pp. 173-191.2469850206.02703","DOI":"10.1016\/0021-8693(69)90070-2"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"6. HUET G., Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems, J. Assoc. Comput. Mach., Vol. 27, 1980, pp. 797-821.5947000458.68007","DOI":"10.1145\/322217.322230"},{"key":"R7","unstructured":"7. \u00d3'D\u00daNLAING C., Finite and Infinite Regular Thue Systems, Ph. D. dissertation, University of California at Santa Barbara, 1981."},{"key":"R8","unstructured":"8. REDEI L., The Theory of Finitely Generated Commutative Semigroups, Pergamon Press, 1965.1883220133.27904"},{"key":"R9","unstructured":"9. SAKAROVITCH J., Sur les monoides commutatifs, S\u00e9minaire d'Informatique Theorique, Institut de Programmation, n\u00b0 1, 1978, pp. 78-01."}],"container-title":["RAIRO. Informatique th\u00e9orique"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1984180100471\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T09:34:28Z","timestamp":1568799268000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1984180100471"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"references-count":9,"journal-issue":{"issue":"1"},"alternative-id":["ita1984180100471"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1984180100471","relation":{},"ISSN":["0399-0540"],"issn-type":[{"value":"0399-0540","type":"print"}],"subject":[],"published":{"date-parts":[[1984]]}}}