{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T18:02:25Z","timestamp":1784484145472,"version":"3.55.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032313478","type":"print"},{"value":"9783032313485","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T00:00:00Z","timestamp":1784505600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T00:00:00Z","timestamp":1784505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2027]]},"DOI":"10.1007\/978-3-032-31348-5_35","type":"book-chapter","created":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T17:29:44Z","timestamp":1784482184000},"page":"528-536","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Polynomial-Time Algorithm for\u00a0the\u00a0Automatic Baire Property"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3810-9303","authenticated-orcid":false,"given":"Ludwig","family":"Staiger","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,20]]},"reference":[{"key":"35_CR1","unstructured":"Baase, S., Gelder, A.V.: Computer Algorithms - Introduction to Design and Analysis. Addison - Wesley, Reading (2000). http:\/\/vig.pearsoned.com\/store\/product\/1,1207,store-12521_isbn-0201612445,00.html"},{"key":"35_CR2","doi-asserted-by":"publisher","unstructured":"Boker, U.: Inherent size blowup in $$\\omega $$-automata. In: Hofman, P., Skrzypczak, M. (eds.) Developments in Language Theory, Lecture Notes in Computer Science, vol. 11647, pp. 3\u201317. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24886-4_1","DOI":"10.1007\/978-3-030-24886-4_1"},{"key":"35_CR3","unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second order arithmetic. In: Logic, Methodology and Philosophy of Science (Proceedings of the 1960 International Congress), pp. 1\u201311. Stanford Univ. Press, Stanford (1962)"},{"key":"35_CR4","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2009)"},{"key":"35_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-030-40608-0_21","volume-title":"Language and Automata Theory and Applications","author":"O Finkel","year":"2020","unstructured":"Finkel, O.: The automatic Baire property and an effective property of $$\\omega $$-rational functions. In: Leporati, A., Mart\u00edn-Vide, C., Shapira, D., Zandron, C. (eds.) LATA 2020. LNCS, vol. 12038, pp. 303\u2013314. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-40608-0_21"},{"issue":"7","key":"35_CR6","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1142\/S0129054121500283","volume":"32","author":"O Finkel","year":"2021","unstructured":"Finkel, O.: Two effective properties of $$\\omega $$-rational functions. Int. J. Found. Comput. Sci. 32(7), 901\u2013920 (2021). https:\/\/doi.org\/10.1142\/S0129054121500283","journal-title":"Int. J. Found. Comput. Sci."},{"key":"35_CR7","volume-title":"Topology","author":"K Kuratowski","year":"1966","unstructured":"Kuratowski, K.: Topology, vol. I. Pa\u0144stwowe Wydawnictwo Naukowe, Warsaw (1966)"},{"key":"35_CR8","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/BF01691063","volume":"3","author":"LH Landweber","year":"1969","unstructured":"Landweber, L.H.: Decision problems for $$\\omega $$-automata. Math. Systems Theory 3, 376\u2013384 (1969)","journal-title":"Math. Systems Theory"},{"key":"35_CR9","volume-title":"Measure and Category, Graduate Texts in Mathematics","author":"JC Oxtoby","year":"1980","unstructured":"Oxtoby, J.C.: Measure and Category, Graduate Texts in Mathematics, vol. 2. Springer-Verlag, New York-Berlin (1980)"},{"key":"35_CR10","volume-title":"Infinite Words. Automata, Semigroups, Logic and Games","author":"D Perrin","year":"2004","unstructured":"Perrin, D., Pin, J.E.: Infinite Words. Automata, Semigroups, Logic and Games. Elsevier\/Academic Press, Amsterdam (2004)"},{"issue":"1\u20132","key":"35_CR11","first-page":"197","volume":"83","author":"VL Selivanov","year":"2008","unstructured":"Selivanov, V.L., Wagner, K.W.: Complexity of topological properties of regular $$\\omega $$-languages. Fundam. Inform. 83(1\u20132), 197\u2013217 (2008)","journal-title":"Fundam. Inform."},{"key":"35_CR12","doi-asserted-by":"publisher","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.: $$\\omega $$-languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, pp. 339\u2013387. Springer-Verlag, Berlin (1997)"},{"key":"35_CR13","unstructured":"Staiger, L.: The Hausdorff measure of regular $$\\omega $$-languages is computable. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 66, 178\u2013182 (1998)"},{"key":"35_CR14","doi-asserted-by":"crossref","unstructured":"Staiger, L.: On the Hausdorff measure of regular $$\\omega $$-languages in Cantor space. Discr. Math. Theor. Comput. Sci. 17(1), 357\u2013368 (2015). https:\/\/dmtcs.episciences.org\/2112","DOI":"10.46298\/dmtcs.2112"},{"key":"35_CR15","doi-asserted-by":"publisher","unstructured":"Staiger, L.: A note on automatic Baire property. CoRR abs\/2505.18626 (2025). https:\/\/doi.org\/10.48550\/arXiv.2505.18626. to appear in International Journal of Foundations of Computer Science","DOI":"10.48550\/arXiv.2505.18626"},{"key":"35_CR16","first-page":"133","volume-title":"Handbook of Theoretical Computer Science","author":"W Thomas","year":"1990","unstructured":"Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 133\u2013191. Elsevier, Amsterdam (1990)"},{"issue":"2","key":"35_CR17","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 $$\\omega $$-regular sets. Inform. Control 43(2), 123\u2013177 (1979). https:\/\/doi.org\/10.1016\/S0019-9958(79)90653-3","journal-title":"Inform. Control"}],"container-title":["Lecture Notes in Computer Science","Timeless Machines: Computability Across Eras"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-31348-5_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T17:29:46Z","timestamp":1784482186000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-31348-5_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,20]]},"ISBN":["9783032313478","9783032313485"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-31348-5_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,20]]},"assertion":[{"value":"20 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CiE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Computability in Europe","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}