{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T05:27:51Z","timestamp":1740461271062,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642151545"},{"type":"electronic","value":"9783642151552"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15155-2_38","type":"book-chapter","created":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T20:17:45Z","timestamp":1281730665000},"page":"429-440","source":"Crossref","is-referenced-by-count":2,"title":["On the Topological Complexity of MSO+U and Related Automata Models"],"prefix":"10.1007","author":[{"given":"Szczepan","family":"Hummel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u0142","family":"Skrzypczak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Szymon","family":"Toru\u0144czyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"Boja\u0144czyk, M., Colcombet, T.: Bounds in \u03c9-regularity. In: LICS, pp. 285\u2013296 (2006)","DOI":"10.1109\/LICS.2006.17"},{"key":"38_CR2","unstructured":"Boja\u0144czyk, M.: Weak MSO with the unbounding quantifier. In: STACS, pp. 159\u2013170 (2009)"},{"key":"38_CR3","unstructured":"Boja\u0144czyk, M.: Beyond \u03c9-regular languages. In: STACS, pp. 11\u201316 (2010)"},{"key":"38_CR4","unstructured":"Boja\u0144czyk, M., Toru\u0144czyk, S.: Deterministic automata and extensions of Weak MSO. In: FSTTCS, pp. 73\u201384 (2009)"},{"key":"38_CR5","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4190-4","volume-title":"Classical Descriptive Set Theory","author":"A.S. Kechris","year":"1995","unstructured":"Kechris, A.S.: Classical Descriptive Set Theory. Graduate Texts in Mathematics, vol.\u00a0156. Springer, Heidelberg (1995)"},{"key":"38_CR6","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-85473-6","volume-title":"A\u00a0Course on Borel Sets","author":"S.M. Srivastava","year":"1998","unstructured":"Srivastava, S.M.: A\u00a0Course on Borel Sets. Graduate Texts in Mathematics, vol.\u00a0180. Springer, Heidelberg (1998)"},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"Thomas, W., Lescow, H.: Logical specifications of infinite computations. In: REX School\/Symposium, pp. 583\u2013621 (1993)","DOI":"10.1007\/3-540-58043-3_29"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15155-2_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T12:31:40Z","timestamp":1740400300000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15155-2_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642151545","9783642151552"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15155-2_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}