{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,7,23]],"date-time":"2022-07-23T08:40:45Z","timestamp":1658565645755},"reference-count":17,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1992]]},"DOI":"10.1051\/ita\/1992260100451","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T15:01:25Z","timestamp":1486047685000},"page":"45-58","source":"Crossref","is-referenced-by-count":0,"title":["Rebootable and suffix-closed $\\omega $-power languages"],"prefix":"10.1051","volume":"26","author":[{"given":"B.","family":"Le Sa\u00ebc","sequence":"first","affiliation":[]},{"given":"I.","family":"Litovsky","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"1. ARNOLD A., A Syntactic Congruence for Rational \u03c9-languages, Theoret Comput. Sci., 1985, 39, pp. 333-335.8212110578.68057","DOI":"10.1016\/0304-3975(85)90148-3"},{"key":"R2","unstructured":"2. ARNOLD A. and NIVAT M., Comportements de processus, Rapport interne, L.I.T.P., 1982, pp. 82-12."},{"key":"R3","unstructured":"3. BERTSEL J. and PERRIN D., Theory of Codes, Academic Press, New York, 1985.7970690587.68066"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"4. BOASSON L. and NIVAT M., Adherences of Languages, J. Comput. System Sci., 1980, 20, pp. 285-309.5848630471.68052","DOI":"10.1016\/0022-0000(80)90010-0"},{"key":"R5","unstructured":"5. B\u00dcCHI J. R., On Decision Method in Restricted Second-Order Arithmetics, Proc. Congr. Logic, Method. and Phulos. Sci., Stanford Univ. Press, 1962, p. 1-11.1836360147.25103"},{"key":"R6","unstructured":"6. EILENBERG S., Automata, Languages and Machines, A, Academic Press, New York, 1974.530382"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"7. J\u00dcRGENSEN H. and THIERRIN G., On \u03c9-languages Whose Syntactic Monoid is Trivial, J. Comput. Inform. Sci., 1983, 12, pp. 359-365.7417850545.68072","DOI":"10.1007\/BF01008047"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"8. LANDWEBER L. H., Decision Problems for \u03c9-Automata, Math. Syst. Theory, 1969, 3, pp. 376-384.2605950182.02402","DOI":"10.1007\/BF01691063"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"9. LATTEUX M. and TIMMERAN E., Finitely Generated \u03c9-Languages, Inform Process. Lett., 1986, 23, pp. 171-175.8713750627.68059","DOI":"10.1016\/0020-0190(86)90131-6"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"10. LINDER R. and STAIGER L., Algebraische Codierungstheorie-Theorie der sequentiellen Codierungen, Akademie-Verlag, Berlin, 1977.4694950363.94016","DOI":"10.1515\/9783112546369"},{"key":"R11","unstructured":"11. LITOVSKY I., G\u00e9n\u00e9rateurs des langages rationnels de mots infinis, Th\u00e8se, Univ. Lille-I, 1988."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"12. LITOVSKY I., and TIMMERMAN E., On Generators of Rational \u03c9-Power Languages, Theoret. Comput. Sci., 1987, 53, pp. 187-200.9180890632.68080","DOI":"10.1016\/0304-3975(87)90063-6"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"13. MACNAUGHTON R., Testing and Generating Infinite Sequences by a Finite Automaton, Inform. Control, 1966, 9, pp. 521-530.2132410212.33902","DOI":"10.1016\/S0019-9958(66)80013-X"},{"key":"R14","unstructured":"14. STAIGER L., A Note on Connected \u03c9-languages, Elektron. Inform. Kybernetik, 1980, 16, 5\/6, pp. 245-251.6012790452.68085"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"15. STAIGER L., Finite State \u03c9-Languages, J. Comput. System Sci., 1983, 27, pp. 434-448.7273900541.68052","DOI":"10.1016\/0022-0000(83)90051-X"},{"key":"R16","doi-asserted-by":"crossref","unstructured":"16. SAIGER L., On Infinitary Finite Length Codes, Theore. Inform. Appli. 1986, 20, 4, pp. 483-494.922738808490628.68056","DOI":"10.1051\/ita\/1986200404831"},{"key":"R17","unstructured":"17. STAIGER L., Research in the Theory of \u03c9-Languages, Elektron. Inform. Kybernetik, 1987, 23, 8\/9, pp. 415-439.9233340637.68095"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1992260100451\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,23]],"date-time":"2022-07-23T08:25:07Z","timestamp":1658564707000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1992260100451"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"references-count":17,"journal-issue":{"issue":"1"},"alternative-id":["ita1992260100451"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1992260100451","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992]]}}}