{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:52:24Z","timestamp":1740099144857,"version":"3.37.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030002497"},{"type":"electronic","value":"9783030002503"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00250-3_10","type":"book-chapter","created":{"date-parts":[[2018,8,30]],"date-time":"2018-08-30T02:56:51Z","timestamp":1535597811000},"page":"133-145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["B\u00fcchi VASS Recognise $$\\mathbf {\\Sigma }^{1}_{1}$$-complete $${\\omega }$$-languages"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9647-4993","authenticated-orcid":false,"given":"Micha\u0142","family":"Skrzypczak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,30]]},"reference":[{"issue":"3","key":"10_CR1","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/s00224-010-9279-2","volume":"48","author":"M Boja\u0144czyk","year":"2011","unstructured":"Boja\u0144czyk, M.: Weak MSO with the unbounding quantifier. Theory Comput. Syst. 48(3), 554\u2013576 (2011)","journal-title":"Theory Comput. Syst."},{"key":"10_CR2","unstructured":"Boja\u0144czyk, M., Colcombet, T.: Bounds in $$\\omega $$-regularity. In: LICS, pp. 285\u2013296 (2006)"},{"key":"10_CR3","unstructured":"Boja\u0144czyk, M., Toru\u0144czyk, S.: Deterministic automata and extensions of weak MSO. In: FSTTCS, pp. 73\u201384 (2009)"},{"key":"10_CR4","unstructured":"Cabessa, J., Duparc, J., Facchini, A., Murlak, F.: The Wadge hierarchy of max-regular languages. In: FSTTCS, pp. 121\u2013132 (2009)"},{"key":"10_CR5","unstructured":"Colcombet, T.: Forms of determinism for automata. In: STACS, pp. 1\u201323 (2012)"},{"issue":"1\u20132","key":"10_CR6","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0304-3975(00)00111-0","volume":"257","author":"J Duparc","year":"2001","unstructured":"Duparc, J., Finkel, O., Ressayre, J.P.: Computer science and the fine structure of Borel sets. Theor. Comput. Sci. 257(1\u20132), 85\u2013105 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-642-35722-0_13","volume-title":"Logical Foundations of Computer Science","author":"J Duparc","year":"2013","unstructured":"Duparc, J., Finkel, O., Ressayre, J.-P.: The Wadge hierarchy of petri nets $$\\omega $$-languages. In: Artemov, S., Nerode, A. (eds.) LFCS 2013. LNCS, vol. 7734, pp. 179\u2013193. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-35722-0_13"},{"issue":"5","key":"10_CR8","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1017\/S0960129506005597","volume":"16","author":"O Finkel","year":"2006","unstructured":"Finkel, O.: Borel ranks and Wadge degrees of context free omega-languages. Math. Struct. Comput. Sci. 16(5), 813\u2013840 (2006)","journal-title":"Math. Struct. Comput. Sci."},{"key":"10_CR9","unstructured":"Finkel, O.: Wadge degrees of $$\\omega $$-languages of Petri nets (2018)"},{"issue":"5","key":"10_CR10","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.ipl.2013.12.007","volume":"114","author":"O Finkel","year":"2014","unstructured":"Finkel, O., Skrzypczak, M.: On the topological complexity of w-languages of non-deterministic Petri nets. Inf. Process. Lett. 114(5), 229\u2013233 (2014)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"10_CR11","doi-asserted-by":"crossref","first-page":"87","DOI":"10.3233\/FI-2012-728","volume":"119","author":"S Hummel","year":"2012","unstructured":"Hummel, S., Skrzypczak, M.: The topological complexity of MSO+U and related automata models. Fundam. Inform. 119(1), 87\u2013111 (2012)","journal-title":"Fundam. Inform."},{"key":"10_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4190-4","volume-title":"Classical Descriptive Set Theory","author":"A Kechris","year":"1995","unstructured":"Kechris, A.: Classical Descriptive Set Theory. Springer, New York (1995). https:\/\/doi.org\/10.1007\/978-1-4612-4190-4"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/3-540-58043-3_29","volume-title":"A Decade of Concurrency Reflections and Perspectives","author":"W Thomas","year":"1994","unstructured":"Thomas, W., Lescow, H.: Logical specifications of infinite computations. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1993. LNCS, vol. 803, pp. 583\u2013621. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58043-3_29"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00250-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,8]],"date-time":"2020-11-08T13:04:07Z","timestamp":1604840647000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00250-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030002497","9783030002503"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00250-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}