{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T08:02:21Z","timestamp":1648800141635},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,8,1]],"date-time":"1991-08-01T00:00:00Z","timestamp":681004800000},"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":8021,"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":[[1991,8]]},"DOI":"10.1016\/0304-3975(91)90046-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"33-52","source":"Crossref","is-referenced-by-count":7,"title":["Finitely generated bi\u03c9-languages"],"prefix":"10.1016","volume":"85","author":[{"given":"J.","family":"Devolder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"Litovsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90046-5_BIB1","series-title":"Th\u00e8se d'\u00e9tat","article-title":"Automates sur les mots biinfinis","author":"Beauquier","year":"1986"},{"key":"10.1016\/0304-3975(91)90046-5_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\/0304-3975(91)90046-5_BIB3","series-title":"Proc. Congr. Logic, Method and Philosophy of Science","first-page":"1","article-title":"On decision method in restricted second-order arithmetics","author":"B\u00fcchi","year":"1962"},{"key":"10.1016\/0304-3975(91)90046-5_BIB4","series-title":"Extension des morphismes aux mots biinfinis","author":"Devolder","year":"1988"},{"key":"10.1016\/0304-3975(91)90046-5_BIB5","volume":"Vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/0304-3975(91)90046-5_BIB6","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01319913","article-title":"Sofic systems and graphs","volume":"80","author":"Fisher","year":"1975","journal-title":"Monatsh. Math."},{"key":"10.1016\/0304-3975(91)90046-5_BIB7","article-title":"Langages alg\u00e9briques de mots biinfinis","author":"Gire","year":"1986","journal-title":"Rapport LITP No. 86-50"},{"key":"10.1016\/0304-3975(91)90046-5_BIB8","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(91)90046-5_BIB9","series-title":"G\u00e9n\u00e9rateurs des langages rationnels de mots infinis","author":"Litovsky","year":"1988"},{"key":"10.1016\/0304-3975(91)90046-5_BIB10","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0304-3975(87)90063-6","article-title":"On generators of rational \u03c9-power languages","volume":"53","author":"Litovsky","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90046-5_BIB11","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":"McNaughton","year":"1966","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(91)90046-5_BIB12","first-page":"47","article-title":"Ensembles reconnaissables de mots biinfinis","author":"Nivat","year":"1982","journal-title":"Proc. 14th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(91)90046-5_BIB13","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0304-3975(89)90049-2","article-title":"Finitely generated sofic systems","volume":"65","author":"Restivo","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90046-5_BIB14","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/0022-0000(83)90051-X","article-title":"Finite-state \u03c9-languages","volume":"27","author":"Staiger","year":"1983","journal-title":"J. Comput. and System Sci."},{"key":"10.1016\/0304-3975(91)90046-5_BIB15","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1007\/BF01295322","article-title":"Subshifts of finite type and sofic systems","volume":"77","author":"Weiss","year":"1973","journal-title":"Monatsh. Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591900465?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591900465?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:54:39Z","timestamp":1555127679000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397591900465"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,8]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,8]]}},"alternative-id":["0304397591900465"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90046-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,8]]}}}