{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:46:27Z","timestamp":1742978787141,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540857792"},{"type":"electronic","value":"9783540857808"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85780-8_42","type":"book-chapter","created":{"date-parts":[[2008,9,9]],"date-time":"2008-09-09T05:23:54Z","timestamp":1220937834000},"page":"529-542","source":"Crossref","is-referenced-by-count":0,"title":["Complexity of Topological Properties of Regular \u03c9-Languages"],"prefix":"10.1007","author":[{"given":"Victor L.","family":"Selivanov","sequence":"first","affiliation":[]},{"given":"Klaus W.","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"42_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-79235-9","volume-title":"Structural Complextiy I","author":"J.L. Balcazar","year":"1995","unstructured":"Balcazar, J.L., Diaz, J., Gabarro, J.: Structural Complextiy I. Springer, Heidelberg (1995)"},{"key":"42_CR2","unstructured":"Cabessa, J.: A Game Theoretic Approach to the Algebraic Counterpart of the Wagner Hierarchy. PhD Thesis, Universities of Lausanne and Paris-7 (2007)"},{"issue":"7","key":"42_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":"42_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":"1","key":"42_CR5","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":"42_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/3-540-59042-0_69","volume-title":"TAPSOFT \u201995: Theory and Practice of Software Development","author":"S. Krishnan","year":"1995","unstructured":"Krishnan, S., Puri, A., Brayton, R.: Structural complexity of \u03c9-automata. In: Mosses, P.D., Schwartzbach, M.I., Nielsen, M. (eds.) CAAP 1995, FASE 1995, and TAPSOFT 1995. LNCS, vol.\u00a0915, pp. 143\u2013156. Springer, Heidelberg (1995)"},{"key":"42_CR7","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/BF01691063","volume":"4","author":"L.H. Landweber","year":"1969","unstructured":"Landweber, L.H.: Decision problems for \u03c9-automata. Math. Systems Theory\u00a04, 376\u2013384 (1969)","journal-title":"Math. Systems Theory"},{"key":"42_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/3-540-46691-6_8","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"C. L\u00f6ding","year":"1999","unstructured":"L\u00f6ding, C.: Optimal bounds for the transformation of omega-automata. In: Pandu Rangan, C., Raman, V., Ramanujam, R. (eds.) FST TCS 1999. LNCS, vol.\u00a01738, pp. 97\u2013109. Springer, Heidelberg (1999)"},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"Meyer, A., Stockmeyer, L.J.: The equivalence problem for regular expressions with squaring requires exponential time. In: Proc. of the 13th IEEE Symp. on Switching and Automata Theory 1972, pp. 125\u2013129 (1972)","DOI":"10.1109\/SWAT.1972.29"},{"key":"42_CR10","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1007\/978-3-642-59136-5_10","volume-title":"Handbook of Formal Languages","author":"J.-E. Pin","year":"1997","unstructured":"Pin, J.-E.: Syntactic semigroups. In: Handbook of Formal Languages, pp. 679\u2013746. Springer, Heidelberg (1997)"},{"key":"42_CR11","series-title":"Pure and Applied Math","volume-title":"Infinite Words","author":"D. Perrin","year":"2004","unstructured":"Perrin, D., Pin, J.-E.: Infinite Words. Pure and Applied Math, vol.\u00a0141. Elsevier, Amsterdam (2004)"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Safra, S.: On the complexity of \u03c9-automata. In: Proc. of the 29th IEEE FOCS 1988, pp. 319\u2013327 (1988)","DOI":"10.1109\/SFCS.1988.21948"},{"key":"42_CR13","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":"42_CR14","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(87)90008-9","volume":"49","author":"A.P. Sistla","year":"1987","unstructured":"Sistla, A.P., Vardi, M.Y., Wolper, P.: The complementation problem for B\u00fcchi automata with applications to temporal logic. Theoretical Computer Science\u00a049, 217\u2013237 (1987)","journal-title":"Theoretical Computer Science"},{"key":"42_CR15","first-page":"379","volume":"10","author":"L. Staiger","year":"1974","unstructured":"Staiger, L., Wagner, K.: Automatentheoretische und automatenfreie Characterisierungen topologischer Klassen regul\u00e4rer Folgenmengen. Elektronische Informationsverarbeitung und Kybernetik\u00a010, 379\u2013392 (1974)","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"key":"42_CR16","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, Heidelberg (1997)"},{"key":"42_CR17","first-page":"133","volume-title":"Handbook of Theoretical Computer Science","author":"W. Thomas","year":"1990","unstructured":"Thomas, W.: Automata on infinite objects. In: Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 133\u2013191. Elsevier, Amsterdam (1990)"},{"key":"42_CR18","first-page":"133","volume-title":"Handbook of Formal Languages","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Languages, automata and logic. In: Handbook of Formal Languages, vol.\u00a03, pp. 133\u2013191. Springer, Heidelberg (1997)"},{"key":"42_CR19","first-page":"714","volume":"19","author":"W. Wadge","year":"1972","unstructured":"Wadge, W.: Degrees of complexity of subsets of the Baire space. Notices AMS\u00a019, 714\u2013715 (1972)","journal-title":"Notices AMS"},{"key":"42_CR20","unstructured":"Wadge, W.: Reducibility and determinateness in the Baire space. PhD thesis, University of California, Berkely (1984)"},{"key":"42_CR21","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"},{"key":"42_CR22","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1142\/S0218196793000287","volume":"3","author":"T. Wilke","year":"1993","unstructured":"Wilke, T.: An algebraic theory for for regular languages of finite and infinite words. Int. J. Alg. Comput.\u00a03, 447\u2013489 (1993)","journal-title":"Int. J. Alg. Comput."},{"key":"42_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BFb0028832","volume-title":"Fundamentals of Computation Theory","author":"G. Wechsung","year":"1985","unstructured":"Wechsung, G.: On the Boolean closure of NP. In: Budach, L. (ed.) FCT 1985. LNCS, vol.\u00a0199, pp. 485\u2013493. Springer, Heidelberg (1985)"},{"key":"42_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/3-540-59293-8_202","volume-title":"TAPSOFT \u201995: Theory and Practice of Software Development","author":"T. Wilke","year":"1995","unstructured":"Wilke, T., Yoo, H.: Computing the Wadge degree, the Lipschitz degree, and the Rabin index of a regular language of infinite words in polynomial time. In: Mosses, P.D., Schwartzbach, M.I., Nielsen, M. (eds.) CAAP 1995, FASE 1995, and TAPSOFT 1995. LNCS, vol.\u00a0915, pp. 288\u2013302. Springer, Heidelberg (1995)"},{"key":"42_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/11787006_50","volume-title":"Automata, Languages and Programming","author":"Q. Yan","year":"2006","unstructured":"Yan, Q.: Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 589\u2013600. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85780-8_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T21:30:46Z","timestamp":1675719046000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85780-8_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540857792","9783540857808"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85780-8_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}