{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:12Z","timestamp":1760202612762,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230243"},{"type":"electronic","value":"9783540301240"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","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":[[2004]]},"DOI":"10.1007\/978-3-540-30124-0_7","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T12:27:59Z","timestamp":1267532879000},"page":"41-55","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["A Bounding Quantifier"],"prefix":"10.1007","author":[{"given":"Miko\u0142aj","family":"Boja\u0144czyk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2004,9,9]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/BFb0055804","volume-title":"Mathematical Foundations of Computer Science 1998","author":"K. Barthelmann","year":"1998","unstructured":"Barthelmann, K.: When can an equational simple graph be generated by hyperedge replacement? In: Brim, L., Gruska, J., Zlatu\u0161ka, J. (eds.) MFCS 1998. LNCS, vol.\u00a01450, pp. 543\u2013552. Springer, Heidelberg (1998)"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1007\/3-540-45465-9_71","volume-title":"Automata, Languages and Programming","author":"M. Boja\u0144czyk","year":"2002","unstructured":"Boja\u0144czyk, M.: Two-way alternating automata and finite models. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 833\u2013844. Springer, Heidelberg (2002)"},{"issue":"3","key":"7_CR3","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/S0304-3975(02)00866-6","volume":"298","author":"M. Boja\u0144czyk","year":"2003","unstructured":"Boja\u0144czyk, M.: The finite graph problem for two-way alternating automata. Theoretical Computer Science\u00a0298(3), 511\u2013528 (2003)","journal-title":"Theoretical Computer Science"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-540-24597-1_8","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"A. Bouquet","year":"2003","unstructured":"Bouquet, A., Serre, O., Walukiewicz, I.: Pushdown games with unboundedness and regular conditions. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 88\u201399. Springer, Heidelberg (2003)"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/3-540-44612-5_23","volume-title":"Mathematical Foundations of Computer Science 2000","author":"O. Carton","year":"2000","unstructured":"Carton, O., Thomas, W.: The monadic theory of morphic infinite words and generalizations. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol.\u00a01893, pp. 275\u2013284. Springer, Heidelberg (2000)"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"169","DOI":"10.2307\/2269808","volume":"31","author":"C.C. Elgot","year":"1966","unstructured":"Elgot, C.C., Rabin, M.O.: Decidability and undecidability of extensions of second (first) order theory of (generalized) successor. Journal of Symbolic Logic\u00a031, 169\u2013181 (1966)","journal-title":"Journal of Symbolic Logic"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Klaedtke, F., Ruess, H.: Parikh automata and monadic second\u2013order logics with linear cardinality constraints. Technical Report 177, Institute of Computer Science at Freiburg University (2002)","DOI":"10.1007\/3-540-45061-0_54"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54345-7_80","volume-title":"Mathematical Foundations of Computer Science 1991","author":"D. Niwi\u0144ski","year":"1991","unstructured":"Niwi\u0144ski, D.: On the cardinality of sets of infinite trees recognizable by infinite automata. In: Tarlecki, A. (ed.) MFCS 1991. LNCS, vol.\u00a0520, Springer, Heidelberg (1991)"},{"key":"7_CR9","first-page":"1","volume":"141","author":"M.O. Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Transactions of the AMS\u00a0141, 1\u201323 (1969)","journal-title":"Transactions of the AMS"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Automata on Infinite Objects and Church\u2019s Problem. In: American Mathematical Society, Providence, RI (1972)","DOI":"10.1090\/cbms\/013"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1112\/plms\/s2-30.1.264","volume":"30","author":"F.P. Ramsey","year":"1930","unstructured":"Ramsey, F.P.: On a problem of formal logic. Proceedings of the London Mathematical Society\u00a030, 264\u2013285 (1930)","journal-title":"Proceedings of the London Mathematical Society"},{"key":"7_CR12","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. Vardi Y.","year":"1998","unstructured":"Y. Vardi, M.: 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","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30124-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,22]],"date-time":"2020-01-22T20:03:43Z","timestamp":1579723423000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30124-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230243","9783540301240"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30124-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]},"assertion":[{"value":"9 September 2004","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}