{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:23:19Z","timestamp":1725664999958},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540628446"},{"type":"electronic","value":"9783540687030"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62844-4_27","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:50:44Z","timestamp":1330296644000},"page":"377-394","source":"Crossref","is-referenced-by-count":12,"title":["On \u03c9-power languages"],"prefix":"10.1007","author":[{"given":"Ludwig","family":"Staiger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"27_CR1","volume-title":"Theory of Codes","author":"J. Berstel","year":"1985","unstructured":"J. Berstel and D. Perrin, Theory of Codes, Academic Press, Orlando 1985."},{"key":"27_CR2","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0022-0000(74)80051-6","volume":"8","author":"Y. Choueka","year":"1974","unstructured":"Y. Choueka, Theories of automata on \u03c9-tapes: A simplified approach, J. Comput. System Sci. 8 (1974), 117\u2013141.","journal-title":"J. Comput. System Sci."},{"key":"27_CR3","first-page":"257","volume":"3","author":"R. S. Cohen","year":"1978","unstructured":"R. S. Cohen and A. Y. Gold, \u03c9-computations on deterministic push down machines, J. Comput. System Sci. (1978) 3, 257\u2013300.","journal-title":"J. Comput. System Sci."},{"key":"27_CR4","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0020-0190(84)90079-6","volume":"19","author":"P. Darondeau","year":"1984","unstructured":"Ph. Darondeau and L. Kott, Towards a formal proof system for \u03c9-rational expressions, Inform. Process. Letters 19 (1984), 173\u2013177.","journal-title":"Inform. Process. Letters"},{"key":"27_CR5","volume-title":"Automata, Languages and Machines. Vol. A","author":"S. Eilenberg","year":"1974","unstructured":"S. Eilenberg, Automata, Languages and Machines. Vol. A, Academic Press, New York 1974."},{"key":"27_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(93)90349-X","volume":"110","author":"J. Engelfriet","year":"1993","unstructured":"J.Engelfriet, H.J. Hoogeboom: X-automata on \u03c9-words. Theoret. Comput. Sci. 110 (1993) 1, 1\u201351.","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR7","series-title":"Lect. Notes Comput. Sci 172","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/3-540-13345-3_23","volume-title":"Automata, Languages and Programming","author":"H. Izumi","year":"1984","unstructured":"H. Izumi, Y. Inagaki and N. Honda, A complete axiomsystem of the algebra of closed rational expressions, in: Automata, Languages and Programming (ed. J. Paradaens), Lect. Notes Comput. Sci 172, Springer-Verlag, Berlin 1984, 260\u2013269."},{"key":"27_CR8","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0019-9958(76)90415-0","volume":"31","author":"M. Linna","year":"1976","unstructured":"M. Linna, On \u03c9-sets associated with context-free languages, Inform. Control 31 (1976) 3, 272\u2013293.","journal-title":"Inform. Control"},{"key":"27_CR9","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(77)90058-5","volume":"4","author":"M. Linna","year":"1977","unstructured":"M. Linna, A decidability result for deterministic \u03c9-context-free languages, Theoret. Comput. Sci. 4 (1977), 83\u201398.","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR10","unstructured":"I. Litovsky, Generateurs des langages rationelles de mots infinis. Th\u00e8se, Univ. de Lille Flandres Artois 1988."},{"key":"27_CR11","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0020-0190(91)90134-4","volume":"37","author":"I. Litovsky","year":"1991","unstructured":"I. Litovsky, Prefix-free languages as \u03c9-generators, Inform. Process. Letters 37 (1991) 1, 61\u201365.","journal-title":"Inform. Process. Letters"},{"key":"27_CR12","first-page":"35","volume":"10","author":"I. Litovsky","year":"1991","unstructured":"I. Litovsky, Free submonoids and minimal \u03c9-generators of R\n\n                  \u03c9\n                , Acta Cybernetica 10 (1991) 1\u20132, 35\u201343.","journal-title":"Acta Cybernetica"},{"key":"27_CR13","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0304-3975(87)90063-6","volume":"53","author":"I. Litovsky","year":"1987","unstructured":"I. Litovsky and E. Timmerman, On generators of rational \u03c9-power languages. Theoret. Comput. Sci. 53 (1987) 2\/3, 187\u2013200.","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR14","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","volume":"9","author":"R. McNaughton","year":"1966","unstructured":"R. McNaughton, Testing and generating infinite sequences by a finite automaton, Inform. Control 9 (1966), 521\u2013530.","journal-title":"Inform. Control"},{"key":"27_CR15","series-title":"Lect. Notes Comput. Sci. 104","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoret. Comput. Sci.","author":"D. Park","year":"1981","unstructured":"D. Park, Concurrency and automata on infinite sequences, in: Theoret. Comput. Sci. (P. Deussen ed.), Lect. Notes Comput. Sci. 104, Springer-Verlag, Berlin 1981, 167\u2013183."},{"key":"27_CR16","series-title":"Lect. Notes Comput. Sci. 192","first-page":"1","volume-title":"Automata on Infinite Words","author":"D. Perrin","year":"1985","unstructured":"D. Perrin, An introduction to finite automata on infinite words, in: Automata on Infinite Words (eds. M. Nivat and D. Perrin), Lect. Notes Comput. Sci. 192, Springer-Verlag, Berlin 1985, 1\u201317."},{"key":"27_CR17","unstructured":"R.R. Redziejowski, The theory of general events and its application to parallel programming, Tech. paper TP 18.220, IBM Nordic Lab. Liding\u00f6, Sweden, 1972."},{"key":"27_CR18","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/321312.321326","volume":"13","author":"A. Salomaa","year":"1966","unstructured":"A. Salomaa, Two complete axion systems for the algebra of regular events. J.ACM 13 (1966) 1, 158\u2013169.","journal-title":"J.ACM"},{"key":"27_CR19","volume-title":"Jewels of Formal Language Theory","author":"A. Salomaa","year":"1981","unstructured":"A. Salomaa, Jewels of Formal Language Theory, Computer Sci. Press, Rockville 1981."},{"key":"27_CR20","first-page":"307","volume":"12","author":"L. Staiger","year":"1976","unstructured":"L. Staiger, Regul\u00e4re Nullmengen. Elektron. Informationsverarb. Kybernetik EIK 12 (1976) 6, 307\u2013311.","journal-title":"Elektron. Informationsverarb. Kybernetik EIK"},{"key":"27_CR21","series-title":"Lect. Notes Comput. Sci. 56","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1007\/3-540-08442-8_123","volume-title":"Fundamentals of Computation Theory '77","author":"L. Staiger","year":"1977","unstructured":"L. Staiger, Empty-storage-acceptance of \u03c9-languages. in: Fundamentals of Computation Theory '77 (ed. M. Karpi\u0144ski), Lect. Notes Comput. Sci. 56, Springer-Verlag, Berlin 1977, 516\u2013521."},{"key":"27_CR22","first-page":"245","volume":"16","author":"L. Staiger","year":"1980","unstructured":"L. Staiger, A note on connected \u03c9-languages. Elektron. Informationsverarb. Kybernetik EIK 16 (1980) 5\/6, 245\u2013251.","journal-title":"Elektron. Informationsverarb. Kybernetik EIK"},{"key":"27_CR23","unstructured":"L. Staiger, Measure and category in 393-01. in: Topology and Measure II (eds. J. Flachsmeyer, Z. Frolik and F. Terpe) Part 2, Wiss. Beitr. Ernst-Moritz-Arndt-Universit\u00e4t Greifswald, 1980, 129\u2013136."},{"key":"27_CR24","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/0022-0000(83)90051-X","volume":"27","author":"L. Staiger","year":"1983","unstructured":"L. Staiger, Finite-state \u03c9-languages. J. Comput. System Sci. 27 (1983) 3, 434\u2013448.","journal-title":"J. Comput. System Sci."},{"key":"27_CR25","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1051\/ita\/1986200404831","volume":"20","author":"L. Staiger","year":"1986","unstructured":"L. Staiger, On infinitary finite length codes. RAIRO Infor. th\u00e9or. et Appl. 20 (1986) 4, 483\u2013494.","journal-title":"RAIRO Infor. th\u00e9or. et Appl."},{"key":"27_CR26","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1051\/ita\/1987210201471","volume":"21","author":"L. Staiger","year":"1987","unstructured":"L. Staiger, Sequential mappings of \u03c9-languages. RAIRO Infor. th\u00e9or. et Appl. 21 (1987) 2, 147\u2013173.","journal-title":"RAIRO Infor. th\u00e9or. et Appl."},{"key":"27_CR27","first-page":"415","volume":"23","author":"L. Staiger","year":"1987","unstructured":"L. Staiger, Research in the theory of \u03c9-languages. J. Inform. Process. Cybernetics EIK 23 (1987) 8\/9, 415\u2013439.","journal-title":"J. Inform. Process. Cybernetics EIK"},{"key":"27_CR28","first-page":"133","volume-title":"Handbook of Theoretical Comtputer Science","author":"W. Thomas","year":"1990","unstructured":"W. Thomas, Automata on infinite objects, in: Handbook of Theoretical Comtputer Science (ed. J. Van Leeuwen), Vol. B, Elsevier, Amsterdam 1990, 133\u2013191."},{"key":"27_CR29","first-page":"103","volume":"3","author":"B.A. Trakhtenbrot","year":"1962","unstructured":"B.A. Trakhtenbrot, Finite automata and monadic second order logic. Siberian Math. J. 3 (1962), 103\u2013131. (Russian; English translation in: AMS Transl. 59 (1966), 23\u201355.)","journal-title":"Siberian Math. J."},{"key":"27_CR30","volume-title":"Finite Automata, Behaviour and Synthesis","author":"B.A. Trakhtenbrot","year":"1970","unstructured":"B.A. Trakhtenbrot and Ya.M. Barzdin, Finite Automata, Behaviour and Synthesis. Nauka Publishers, Moscow 1970. (Russian; English translation: North Holland, Amsterdam 1973)"},{"key":"27_CR31","first-page":"337","volume":"12","author":"K. Wagner","year":"1976","unstructured":"K. Wagner, Eine Axiomatisierung der Theorie der regul\u00e4ren Folgenmengen. Elektron. Informationsverarb. Kybernetik EIK 12 (1976) 7, 337\u2013354.","journal-title":"Elektron. Informationsverarb. Kybernetik EIK"}],"container-title":["Lecture Notes in Computer Science","New Trends in Formal Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62844-4_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:39:49Z","timestamp":1619573989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62844-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540628446","9783540687030"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/3-540-62844-4_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}