{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T20:34:12Z","timestamp":1648672452353},"reference-count":7,"publisher":"EDP Sciences","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO. Inform. th\u00e9or."],"published-print":{"date-parts":[[1981]]},"DOI":"10.1051\/ita\/1981150403731","type":"journal-article","created":{"date-parts":[[2017,2,6]],"date-time":"2017-02-06T10:30:23Z","timestamp":1486377023000},"page":"373-391","source":"Crossref","is-referenced-by-count":6,"title":["Finiteness results on rewriting systems"],"prefix":"10.1051","volume":"15","author":[{"given":"Jean-Claude","family":"Raoult","sequence":"first","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","unstructured":"1. BOURBAKI N., Th\u00e9orie des Ensembles, Chapt. III, \u00a7 6, No. 5, Hermann, Paris, 1963.0125.00603154814"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"2. HUET G., Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems, in Proceedings of the 18th annual I.E.E.E. Symposium on Fondations of Computer Science, October 1977.660480","DOI":"10.1109\/SFCS.1977.9"},{"key":"R3","unstructured":"3. HUET G. and LANKFORD D. S., On the Uniform Halting Problem jor Term Rewriting Systems, Rapport de Recherche, No. 283, I.R.I.A., March 1978."},{"key":"R4","doi-asserted-by":"crossref","unstructured":"4. KNUTH D. E. and BENDIX P., Simple Words Problems in Universal Algebras, in Computational Problems in Abstract Algebras, Ed., J. LEECH, Pergamon Press, 1970, pp. 263-297.2554720188.04902","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"R5","unstructured":"5. LANKFORD D. S. and BALLANTYNE A. M., The Rejutation Completeness of Blocked Permutative Narrowing and Resolution (to appear)."},{"key":"R6","doi-asserted-by":"crossref","unstructured":"6. RAOULT J. C. and VUILLEMIN J., Operational and Denotational Equivalences Between Recursive Programs, Rapport de Recherche, No. 9, L.R.I., Orsay, June 1978.1282.68165","DOI":"10.1145\/800133.804334"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"7. THATCHER J. W. and WRIGHT J. B., Generalized Finite Automata Theory with an Application to a Decision Problem of Second Order Logic, Math. System Theory, Vol. 2, 1968, pp. 57-81.2244760157.02201","DOI":"10.1007\/BF01691346"}],"container-title":["RAIRO. Informatique th\u00e9orique"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1981150403731\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T05:32:50Z","timestamp":1568784770000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1981150403731"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"references-count":7,"journal-issue":{"issue":"4"},"alternative-id":["ita1981150403731"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1981150403731","relation":{},"ISSN":["0399-0540"],"issn-type":[{"value":"0399-0540","type":"print"}],"subject":[],"published":{"date-parts":[[1981]]}}}