{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T17:29:42Z","timestamp":1772386182297,"version":"3.50.1"},"reference-count":10,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"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":9694,"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":[[1987]]},"DOI":"10.1016\/0304-3975(87)90063-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"187-200","source":"Crossref","is-referenced-by-count":17,"title":["On generators of rational \u03c9-power languages"],"prefix":"10.1016","volume":"53","author":[{"given":"I.","family":"Litovsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Timmerman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(87)90063-6_BIB1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(85)90148-3","article-title":"A syntactic congruence for rational \u03c9-languages","volume":"39","author":"Arnold","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(87)90063-6_BIB2","series-title":"Theory of Codes","author":"Berstel","year":"1985"},{"key":"10.1016\/0304-3975(87)90063-6_BIB3","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0022-0000(80)90010-0","article-title":"Adherences of languages","volume":"20","author":"Doasson","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(87)90063-6_BIB4","series-title":"Proc. Internat. Cong. Logic, Methodology and Philosophy","first-page":"1","article-title":"On a decision method in restricted second order arithmetic","author":"B\u00fcchi","year":"1960"},{"key":"10.1016\/0304-3975(87)90063-6_BIB5","volume":"Vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/0304-3975(87)90063-6_BIB6","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0020-0190(86)90131-6","article-title":"Finitely generated \u03c9-languages","volume":"23","author":"Latteux","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(87)90063-6_BIB7","article-title":"Automates \u00e0 cycles et automates des facteurs gauches","volume":"1","author":"Le Saec","year":"1985"},{"key":"10.1016\/0304-3975(87)90063-6_BIB8","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","article-title":"Testing and generating infinite sequences by a finite automaton","volume":"9","author":"MacNaughton","year":"1966","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(87)90063-6_BIB9","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1051\/ita\/1978120302591","article-title":"Sur les ensembles de mots infinis engendr\u00e9s par une grammaire alg\u00e9brique","volume":"12","author":"Nivat","year":"1978","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/0304-3975(87)90063-6_BIB10","series-title":"Automata on Infinite words","first-page":"2","article-title":"An introduction to finite automata of infinite words","volume":"192","author":"Perrin","year":"1985"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397587900636?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397587900636?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:52:51Z","timestamp":1555127571000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397587900636"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"references-count":10,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1987]]}},"alternative-id":["0304397587900636"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(87)90063-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1987]]}}}