{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:10:51Z","timestamp":1725491451537},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540732075"},{"type":"electronic","value":"9783540732082"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73208-2_37","type":"book-chapter","created":{"date-parts":[[2007,9,12]],"date-time":"2007-09-12T07:58:11Z","timestamp":1189583891000},"page":"399-410","source":"Crossref","is-referenced-by-count":6,"title":["Fine Hierarchy of Regular Aperiodic \u03c9-Languages"],"prefix":"10.1007","author":[{"given":"Victor L.","family":"Selivanov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.2307\/1994916","volume":"138","author":"J.R. B\u00fcchi","year":"1969","unstructured":"B\u00fcchi, J.R., Landweber, L.H.: Solving sequential conditions by finite-state strategies. Trans. Amer. Math. Soc.\u00a0138, 295\u2013311 (1969)","journal-title":"Trans. Amer. Math. Soc."},{"key":"37_CR2","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0022-4049(99)00093-6","volume":"153","author":"O. Carton","year":"2000","unstructured":"Carton, O.: Wreath product and infinite words. J. Pure and Applied Algebra\u00a0153, 129\u2013150 (2000)","journal-title":"J. Pure and Applied Algebra"},{"issue":"7","key":"37_CR3","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1142\/S0218196797000290","volume":"7","author":"O. Carton","year":"1997","unstructured":"Carton, O., Perrin, D.: Chains and superchains for \u03c9-rational sets, automata and semigroups. International Journal of Algebra and Computation\u00a07(7), 673\u2013695 (1997)","journal-title":"International Journal of Algebra and Computation"},{"issue":"7","key":"37_CR4","first-page":"673","volume":"9","author":"O. Carton","year":"1999","unstructured":"Carton, O., Perrin, D.: The Wagner hierarchy of \u03c9-rational sets. International Journal of Algebra and Computation\u00a09(7), 673\u2013695 (1999)","journal-title":"International Journal of Algebra and Computation"},{"issue":"3","key":"37_CR5","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1016\/S0304-3975(02)00567-4","volume":"290","author":"J. Duparc","year":"2003","unstructured":"Duparc, J.: A hierarchy of deterministic context-free \u03c9-languages. Theoretical Computer Science\u00a0290(3), 1253\u20131300 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"37_CR6","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1142\/S0218196706002871","volume":"16","author":"J. Duparc","year":"2006","unstructured":"Duparc, J., Riss, M.: The missing link for \u03c9-rational sets, automata, and semigroups. International Journal of Algebra and Computation\u00a016(1), 161\u2013185 (2006)","journal-title":"International Journal of Algebra and Computation"},{"key":"37_CR7","volume-title":"Classical Descriptive Set Theory","author":"A.S. Kechris","year":"1994","unstructured":"Kechris, A.S.: Classical Descriptive Set Theory. Springer, Berlin Heidelberg (1994)"},{"key":"37_CR8","volume-title":"Counter-free automata","author":"R. McNaughton","year":"1971","unstructured":"McNaughton, R., Papert, S.: Counter-free automata. MIT Press, Cambridge, Massachusets (1971)"},{"key":"37_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/11787006_35","volume-title":"Automata, Languages and Programming","author":"F. Murlak","year":"2006","unstructured":"Murlak, F.: The Wadge hierarchy of deterministic tree languages. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 408\u2013419. Springer, Heidelberg (2006)"},{"key":"37_CR10","volume-title":"Infinite Words. Pure and Applied Mathematics","author":"D. Perrin","year":"2004","unstructured":"Perrin, D., Pin, J.-E.: Infinite Words. Pure and Applied Mathematics, vol.\u00a0141. Elsevier, Amsterdam (2004)"},{"key":"37_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/3-540-57785-8_161","volume-title":"STACS 1994","author":"V.L. Selivanov","year":"1994","unstructured":"Selivanov, V.L.: Two refinements of the polynomial hierarchy. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol.\u00a0775, pp. 439\u2013448. Springer, Heidelberg (1994)"},{"key":"37_CR12","unstructured":"Selivanov, V.L.: Fine hierarchy of regular \u03c9-languages. Preprint N 14, the University of Heidelberg, Chair of Mathematical Logic, p. 13 (1994)"},{"key":"37_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/3-540-59293-8_201","volume-title":"TAPSOFT \u201995: Theory and Practice of Software Development","author":"V.L. Selivanov","year":"1995","unstructured":"Selivanov, V.L.: Fine hierarchy of regular \u03c9-languages. In: Mosses, P.D., Schwartzbach, M.I., Nielsen, M. (eds.) CAAP 1995, FASE 1995, and TAPSOFT 1995. LNCS, vol.\u00a0915, pp. 277\u2013287. Springer, Heidelberg (1995)"},{"key":"37_CR14","doi-asserted-by":"publisher","first-page":"289","DOI":"10.2307\/2275522","volume":"60","author":"V.L. Selivanov","year":"1995","unstructured":"Selivanov, V.L.: Fine hierarchies and Boolean terms. Journal of Symbolic Logic\u00a060, 289\u2013317 (1995)","journal-title":"Journal of Symbolic Logic"},{"key":"37_CR15","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0304-3975(97)00301-0","volume":"191","author":"V.L. Selivanov","year":"1998","unstructured":"Selivanov, V.L.: Fine hierarchy of regular \u03c9-languages. Theoretical Computer Science\u00a0191, 37\u201359 (1998)","journal-title":"Theoretical Computer Science"},{"key":"37_CR16","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1051\/ita:2003008","volume":"37","author":"V.L. Selivanov","year":"2003","unstructured":"Selivanov, V.L.: Wadge degrees of \u03c9-languages of deterministic Turing machines. Theoretical Informatics and Applications\u00a037, 67\u201383 (2003)","journal-title":"Theoretical Informatics and Applications"},{"key":"37_CR17","unstructured":"Selivanov, V.L.: Fine hierarchy of regular aperiodic \u03c9-languages. Technical report No 390, Institute of Informatics, University of W\u00fcrzburg, p. 21 (2006)"},{"key":"37_CR18","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/978-3-642-59126-6_6","volume-title":"Handbook of Formal Languages","author":"L. Staiger","year":"1997","unstructured":"Staiger, L.: \u03c9-Languages. In: Handbook of Formal Languages, vol.\u00a03, pp. 339\u2013387. Springer, Berlin Heidelberg (1997)"},{"issue":"7","key":"37_CR19","first-page":"379","volume":"10","author":"L. Staiger","year":"1974","unstructured":"Staiger, L., Wagner, K.: Automatentheoretische und automatenfreie Characterisierungen topologischer klassen regul\u00e4rer Folgenmengen. Elektron.Inf. verarb. Kybern. EIK\u00a010(7), 379\u2013392 (1974)","journal-title":"Elektron.Inf. verarb. Kybern. EIK"},{"key":"37_CR20","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/S0019-9958(79)90629-6","volume":"42","author":"W. Thomas","year":"1979","unstructured":"Thomas, W.: Star-free regular sets of \u03c9-sequences. Information and Control\u00a042, 148\u2013156 (1979)","journal-title":"Information and Control"},{"key":"37_CR21","first-page":"133","volume":"B","author":"W. Thomas","year":"1990","unstructured":"Thomas, W.: Automata on infinite objects. Handbook of Theoretical Computer Science\u00a0B, 133\u2013191 (1990)","journal-title":"Handbook of Theoretical Computer Science"},{"key":"37_CR22","first-page":"133","volume":"B","author":"W. Thomas","year":"1996","unstructured":"Thomas, W.: Languages, automata and logic. Handbook of Formal Language theory\u00a0B, 133\u2013191 (1996)","journal-title":"Handbook of Formal Language theory"},{"key":"37_CR23","unstructured":"Trakhtenbrot, B.A., Barzdin, J.M.: Finite automata. Behaviour and Synthesis (Russian, English translation 1973), Mir, Moscow. North Holland, Amsterdam (1970)"},{"key":"37_CR24","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0019-9958(79)90653-3","volume":"43","author":"K. Wagner","year":"1979","unstructured":"Wagner, K.: On \u03c9-regular sets. Information and Control\u00a043, 123\u2013177 (1979)","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73208-2_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:05:36Z","timestamp":1619517936000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73208-2_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540732075","9783540732082"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73208-2_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}