{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T19:40:03Z","timestamp":1748461203791,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476659"},{"type":"electronic","value":"9783662476666"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-47666-6_16","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T07:46:47Z","timestamp":1434700007000},"page":"197-208","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Trading Bounds for Memory in Games with Counters"],"prefix":"10.1007","author":[{"given":"Nathana\u00ebl","family":"Fijalkow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florian","family":"Horn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Denis","family":"Kuperberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u0142","family":"Skrzypczak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Blumensath, A., Colcombet, T., Kuperberg, D., Parys, P., Boom, M.V.: Two-way cost automata and cost logics over infinite trees. In: CSL-LICS, pp. 16\u201326 (2014)","key":"16_CR1","DOI":"10.1145\/2603088.2603104"},{"doi-asserted-by":"crossref","unstructured":"Blumensath, A., Otto, M., Weyer, M.: Decidability results for the boundedness problem. Logical Methods in Computer Science 10(3) (2014)","key":"16_CR2","DOI":"10.2168\/LMCS-10(3:2)2014"},{"key":"16_CR3","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. 3210, pp. 41\u201355. Springer, Heidelberg (2004)"},{"unstructured":"Boja\u0144czyk, M., Colcombet, T.: Bounds in $$\\omega $$-regularity. In: LICS, pp. 285\u2013296 (2006)","key":"16_CR4"},{"unstructured":"Colcombet, T.: Fonctions r\u00e9guli\u00e8res de co\u00fbt. Habilitation Thesis (2013)","key":"16_CR5"},{"doi-asserted-by":"crossref","unstructured":"Colcombet, T.: Regular cost functions, part I: logic and algebra over words. Logical Methods in Computer Science 9(3) (2013)","key":"16_CR6","DOI":"10.2168\/LMCS-9(3:3)2013"},{"key":"16_CR7","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. 5126, pp. 398\u2013409. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Colcombet, T., L\u00f6ding, C.: Regular cost functions over finite trees. In: LICS, pp. 70\u201379 (2010)","key":"16_CR8","DOI":"10.1109\/LICS.2010.36"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/3-540-36387-4_1","volume-title":"Automata, Logics, and Infinite Games","author":"B Farwer","year":"2002","unstructured":"Farwer, B.: 1 omega-automata. In: Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.) Automata, Logics, and Infinite Games. LNCS, vol. 2500, pp. 3\u201321. Springer, Heidelberg (2002)"},{"issue":"1","key":"16_CR10","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0304-3975(90)90044-I","volume":"72","author":"K Hashiguchi","year":"1990","unstructured":"Hashiguchi, K.: Improved limitedness theorems on finite automata with distance functions. Theoretical Computer Science 72(1), 27\u201338 (1990)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"16_CR11","first-page":"455","volume":"39","author":"D Kirsten","year":"2005","unstructured":"Kirsten, D.: Distance desert automata and the star height problem. ITA 39(3), 455\u2013509 (2005)","journal-title":"ITA"},{"doi-asserted-by":"crossref","unstructured":"Kupferman, O., Vardi, M.Y.: Weak alternating automata are not that weak. In: 5th Israeli Symposium on Theory of Computing and Systems, pp. 147\u2013158. IEEE Computer Society Press (1997)","key":"16_CR12","DOI":"10.1109\/ISTCS.1997.595167"},{"issue":"1","key":"16_CR13","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0304-3975(91)90321-R","volume":"81","author":"H Leung","year":"1991","unstructured":"Leung, H.: Limitedness theorem on finite automata with distance functions: An algebraic proof. Theoretical Computuer Science 81(1), 137\u2013145 (1991)","journal-title":"Theoretical Computuer Science"},{"key":"16_CR14","first-page":"1","volume":"141","author":"MO Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Transactions of the AMS 141, 1\u201323 (1969)","journal-title":"Transactions of the AMS"},{"issue":"3\u20134","key":"16_CR15","first-page":"277","volume":"28","author":"I Simon","year":"1994","unstructured":"Simon, I.: On semigroups of matrices over the tropical semiring. ITA 28(3\u20134), 277\u2013294 (1994)","journal-title":"ITA"},{"key":"16_CR16","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":"MV Boom","year":"2011","unstructured":"Boom, M.V.: Weak cost monadic logic over infinite trees. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol. 6907, pp. 580\u2013591. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47666-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T19:03:16Z","timestamp":1748458996000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47666-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476659","9783662476666"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47666-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}