{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T14:03:43Z","timestamp":1648908223030},"reference-count":6,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1986,11,1]],"date-time":"1986-11-01T00:00:00Z","timestamp":531187200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1986,11]]},"DOI":"10.1016\/0020-0190(86)90131-6","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:37:33Z","timestamp":1047652653000},"page":"171-175","source":"Crossref","is-referenced-by-count":11,"title":["Finitely generated \u03c9-languages"],"prefix":"10.1016","volume":"23","author":[{"given":"M.","family":"Latteux","sequence":"first","affiliation":[]},{"given":"E.","family":"Timmerman","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(86)90131-6_BIB1","series-title":"Colloque AFCET \u201cLes Math\u00e9matiques de l'Informatique\u201d","first-page":"35","article-title":"Comportement de processus","author":"Arnold","year":"1982"},{"key":"10.1016\/0020-0190(86)90131-6_BIB2","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0022-0000(80)90010-0","article-title":"Adherences of languages","volume":"20","author":"Boasson","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(86)90131-6_BIB3","series-title":"Internat. Congress of Logic, Methodology and Philosophy of Science","article-title":"On a decision method in restricted second order arithmetics","author":"B\u00fcchi","year":"1962"},{"key":"10.1016\/0020-0190(86)90131-6_BIB4","volume":"Vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/0020-0190(86)90131-6_BIB5","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\/0020-0190(86)90131-6_BIB6","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."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086901316?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086901316?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T05:50:50Z","timestamp":1553579450000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019086901316"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,11]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1986,11]]}},"alternative-id":["0020019086901316"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(86)90131-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1986,11]]}}}