{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:40:02Z","timestamp":1746265202601,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439500"},{"type":"electronic","value":"9783662439517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43951-7_4","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T08:37:49Z","timestamp":1402475869000},"page":"38-49","source":"Crossref","is-referenced-by-count":7,"title":["Weak MSO+U with Path Quantifiers over Infinite Trees"],"prefix":"10.1007","author":[{"given":"Miko\u0142aj","family":"Boja\u0144czyk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-30124-0_7","volume-title":"Computer Science Logic","author":"M. Boja\u0144czyk","year":"2004","unstructured":"Boja\u0144czyk, M.: A bounding quantifier. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol.\u00a03210, pp. 41\u201355. Springer, Heidelberg (2004)"},{"issue":"3","key":"4_CR2","doi-asserted-by":"crossref","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.\u00a048(3), 554\u2013576 (2011)","journal-title":"Theory Comput. Syst."},{"key":"4_CR3","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":"4_CR4","series-title":"LNCS","first-page":"50","volume-title":"ICALP 2014, Part II","author":"M. Boja\u0144czyk","year":"2014","unstructured":"Boja\u0144czyk, M., Gogacz, T., Michalewski, H., Skrzypczak, M.: On the decidability of MSO+U on infinite trees. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014, Part II. LNCS, vol.\u00a08573, pp. 50\u201361. Springer, Heidelberg (2014)"},{"key":"4_CR5","unstructured":"Boja\u0144czyk, M., Toru\u0144czyk, S.: Deterministic automata and extensions of weak mso. In: FSTTCS, pp. 73\u201384 (2009)"},{"key":"4_CR6","unstructured":"Boja\u0144czyk, M., Toru\u0144czyk, S.: wmso+u over infinite trees. In: STACS, pp. 648\u2013660 (2012)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-642-31424-7_8","volume-title":"Computer Aided Verification","author":"T. Br\u00e1zdil","year":"2012","unstructured":"Br\u00e1zdil, T., Chatterjee, K., Ku\u010dera, A., Novotn\u00fd, P.: Efficient controller synthesis for consumption games with multiple resource types. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol.\u00a07358, pp. 23\u201338. Springer, Heidelberg (2012)"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-642-02930-1_12","volume-title":"Automata, Languages and Programming","author":"T. Colcombet","year":"2009","unstructured":"Colcombet, T.: The theory of stabilisation monoids and regular cost functions. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part II. LNCS, vol.\u00a05556, pp. 139\u2013150. Springer, Heidelberg (2009)"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-540-70583-3_33","volume-title":"Automata, Languages and Programming","author":"T. Colcombet","year":"2008","unstructured":"Colcombet, T., L\u00f6ding, C.: The non-deterministic Mostowski hierarchy and distance-parity automata. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 398\u2013409. Springer, Heidelberg (2008)"},{"key":"4_CR10","unstructured":"Fijalkow, N., Zimmermann, M.: Cost-parity and cost-Streett games. In: FSTTCS, pp. 124\u2013135 (2012)"},{"issue":"1","key":"4_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.\u00a0119(1), 87\u2013111 (2012)","journal-title":"Fundam. Inform."},{"issue":"2","key":"4_CR12","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10703-009-0067-z","volume":"34","author":"O. Kupferman","year":"2009","unstructured":"Kupferman, O., Piterman, N., Vardi, M.Y.: From liveness to promptness. Formal Methods in System Design\u00a034(2), 83\u2013103 (2009)","journal-title":"Formal Methods in System Design"},{"key":"4_CR13","unstructured":"McNaughton, R.: Finite state infinite games. Project MAC Report, MIT (1965)"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-642-31585-5_35","volume-title":"Automata, Languages, and Programming","author":"S. Toru\u0144czyk","year":"2012","unstructured":"Toru\u0144czyk, S.: Languages of profinite words and the limitedness problem. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol.\u00a07392, pp. 377\u2013389. Springer, Heidelberg (2012)"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/978-3-642-22993-0_52","volume-title":"Mathematical Foundations of Computer Science 2011","author":"M. Boom Vanden","year":"2011","unstructured":"Vanden Boom, M.: Weak cost monadic logic over infinite trees. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol.\u00a06907, pp. 580\u2013591. Springer, Heidelberg (2011)"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/BFb0055090","volume-title":"Automata, Languages and Programming","author":"M.Y. Vardi","year":"1998","unstructured":"Vardi, M.Y.: Reasoning about the past with two-way automata. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 628\u2013641. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43951-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:23:36Z","timestamp":1746264216000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43951-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439500","9783662439517"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43951-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}