{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T18:45:57Z","timestamp":1767897957775,"version":"3.49.0"},"reference-count":4,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":10424,"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":[[1985]]},"DOI":"10.1016\/0304-3975(85)90148-3","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:04:58Z","timestamp":1052784298000},"page":"333-335","source":"Crossref","is-referenced-by-count":62,"special_numbering":"C","title":["A syntactic congruence for rational \u03c9-languages"],"prefix":"10.1016","volume":"39","author":[{"given":"Andr\u00e9","family":"Arnold","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(85)90148-3_BIB1","series-title":"Transductions and Context-free Languages","author":"Berstel","year":"1979"},{"key":"10.1016\/0304-3975(85)90148-3_BIB2","series-title":"Proc. Internat. Congress on Logic, Methodology and Philosophy","first-page":"1","article-title":"On a decision method in restricted second order arithmetic","author":"B\u00fcchi","year":"1962"},{"key":"10.1016\/0304-3975(85)90148-3_BIB3","volume":"Vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/0304-3975(85)90148-3_BIB4","series-title":"Proc. 1st ICALP'72","first-page":"103","article-title":"A propos des relations rationnelles fonctionnelles","author":"Sch\u00fctzenberger","year":"1973"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585901483?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585901483?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T08:52:48Z","timestamp":1553158368000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397585901483"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":4,"alternative-id":["0304397585901483"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90148-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}