{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:16:21Z","timestamp":1758273381852,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642029295"},{"type":"electronic","value":"9783642029301"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02930-1_12","type":"book-chapter","created":{"date-parts":[[2009,7,2]],"date-time":"2009-07-02T15:05:04Z","timestamp":1246547104000},"page":"139-150","source":"Crossref","is-referenced-by-count":44,"title":["The Theory of Stabilisation Monoids and Regular Cost Functions"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Colcombet","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-540-85361-9_9","volume-title":"CONCUR 2008 - Concurrency Theory","author":"P.A. Abdulla","year":"2008","unstructured":"Abdulla, P.A., Krc\u00e1l, P., Yi, W.: R-automata. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol.\u00a05201, pp. 67\u201381. Springer, Heidelberg (2008)"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Blumensath, A., Otto, M., Weyer, M.: Boundedness of monadic second-order formulae over finite words. In: ICALP 2009 (2009)","DOI":"10.1007\/978-3-642-02930-1_6"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Boja\u0144czyk, M., Colcombet, T.: Bounds in omega-regularity. In: LICS 2006, pp. 285\u2013296 (2006)","DOI":"10.1109\/LICS.2006.17"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-540-87531-4_30","volume-title":"Computer Science Logic","author":"T. Colcombet","year":"2008","unstructured":"Colcombet, T., L\u00f6ding, C.: The nesting-depth of disjunctive mu-calculus for tree languages and the limitedness problem. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol.\u00a05213, pp. 416\u2013430. Springer, Heidelberg (2008)"},{"key":"12_CR5","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)"},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0022-0000(82)90051-4","volume":"24","author":"K. Hashiguchi","year":"1982","unstructured":"Hashiguchi, K.: Limitedness theorem on finite automata with distance functions. J. Comput. Syst. Sci.\u00a024(2), 233\u2013244 (1982)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"12_CR7","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/0890-5401(88)90033-8","volume":"78","author":"K. Hashiguchi","year":"1988","unstructured":"Hashiguchi, K.: Algorithms for determining relative star height and star height. Inf. Comput.\u00a078(2), 124\u2013169 (1988)","journal-title":"Inf. Comput."},{"issue":"1","key":"12_CR8","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. Theor. Comput. Sci.\u00a072(1), 27\u201338 (1990)","journal-title":"Theor. Comput. Sci."},{"issue":"39","key":"12_CR9","first-page":"455","volume":"3","author":"D. Kirsten","year":"2005","unstructured":"Kirsten, D.: Distance desert automata and the star height problem. RAIRO\u00a03(39), 455\u2013509 (2005)","journal-title":"RAIRO"},{"key":"12_CR10","unstructured":"Kirsten, D.: Distance desert automata and star height substitutions. Habilitation, Universit\u00e4t Leipzig, Fakult\u00e4t f\u00fcr Mathematik und Informatik (2006)"},{"issue":"1","key":"12_CR11","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. Theor. Comput. Sci.\u00a081(1), 137\u2013145 (1991)","journal-title":"Theor. Comput. Sci."},{"issue":"1-3","key":"12_CR12","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0304-3975(03)00377-3","volume":"310","author":"H. Leung","year":"2004","unstructured":"Leung, H.: The limitedness problem on distance automata: Hashiguchi\u2019s method revisited. Theoretical Computer Science\u00a0310(1-3), 147 (2004)","journal-title":"Theoretical Computer Science"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Simon, I.: Limited subsets of a free monoid. In: FOCS, pp. 143\u2013150 (1978)","DOI":"10.1109\/SFCS.1978.21"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BFb0017135","volume-title":"Mathematical Foundations of Computer Science 1988","author":"I. Simon","year":"1988","unstructured":"Simon, I.: Recognizable sets with multiplicities in the tropical semiring. In: Koubek, V., Janiga, L., Chytil, M.P. (eds.) MFCS 1988, vol.\u00a0324, pp. 107\u2013120. Springer, Heidelberg (1988)"},{"issue":"3-4","key":"12_CR15","first-page":"277","volume":"28","author":"I. Simon","year":"1994","unstructured":"Simon, I.: On semigroups of matrices over the tropical semiring. ITA\u00a028(3-4), 277\u2013294 (1994)","journal-title":"ITA"},{"issue":"2","key":"12_CR16","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF01202281","volume":"26","author":"A. Weber","year":"1993","unstructured":"Weber, A.: Distance automata having large finite distance or finite ambiguity. Mathematical Systems Theory\u00a026(2), 169\u2013185 (1993)","journal-title":"Mathematical Systems Theory"},{"issue":"1","key":"12_CR17","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0304-3975(94)90287-9","volume":"134","author":"A. Weber","year":"1994","unstructured":"Weber, A.: Finite-valued distance automata. Theor. Comput. Sci.\u00a0134(1), 225\u2013251 (1994)","journal-title":"Theor. Comput. Sci."}],"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-642-02930-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T16:44:49Z","timestamp":1739205889000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02930-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029295","9783642029301"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02930-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}