{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T05:10:08Z","timestamp":1746335408265,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662445211"},{"type":"electronic","value":"9783662445228"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44522-8_33","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T10:12:23Z","timestamp":1407838343000},"page":"390-401","source":"Crossref","is-referenced-by-count":0,"title":["Definability and Transformations for Cost Logics and Automatic Structures"],"prefix":"10.1007","author":[{"given":"Martin","family":"Lang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christof","family":"L\u00f6ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amaldev","family":"Manuel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Colcombet, T.: Regular cost functions over words. Online Manuscript (2009)","DOI":"10.1109\/LICS.2010.36"},{"key":"33_CR2","unstructured":"Kuperberg, D.: Study of classes of regular cost functions. PhD thesis, LIAFA Paris (December 2012)"},{"key":"33_CR3","unstructured":"Kuperberg, D.: Linear temporal logic for regular cost functions. In: STACS. LIPIcs, vol.\u00a09, pp. 627\u2013636. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2011)"},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/0021-8693(69)90107-0","volume":"13","author":"S. Eilenberg","year":"1969","unstructured":"Eilenberg, S., Elgot, C.C., Shepherdson, J.C.: Sets recognized by n-tape automata. J. Algebra\u00a013, 447\u2013464 (1969)","journal-title":"J. Algebra"},{"key":"33_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/3-540-60178-3_93","volume-title":"Logic and Computational Complexity","author":"B. Khoussainov","year":"1995","unstructured":"Khoussainov, B., Nerode, A.: Automatic presentations of structures. In: Leivant, D. (ed.) LCC 1994. LNCS, vol.\u00a0960, pp. 367\u2013392. Springer, Heidelberg (1995)"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Blumensath, A., Gr\u00e4del, E.: Automatic structures. In: Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, pp. 51\u201362. IEEE (2000)","DOI":"10.1109\/LICS.2000.855755"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Lang, M., L\u00f6ding, C.: Modeling and verification of infinite systems with resources. Logical Methods in Computer Science\u00a09(4) (2013)","DOI":"10.2168\/LMCS-9(4:22)2013"},{"issue":"2","key":"33_CR8","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(2), 169\u2013181 (1966)","journal-title":"Journal of Symbolic Logic"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Colcombet, T., L\u00f6ding, C.: Transforming structures by set interpretations. Logical Methods in Computer Science 3(2) (2007)","DOI":"10.2168\/LMCS-3(2:4)2007"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Gr\u00e4del, E.: Finite Model Theory and Descriptive Complexity. In: Finite Model Theory and its Applications, pp. 125\u2013230. Springer (2007)","DOI":"10.1007\/3-540-68804-8_3"},{"key":"33_CR11","unstructured":"Blumensath, A., Colcombet, T., L\u00f6ding, C.: Logical theories and compatible operations. In: Logic and Automata, pp. 73\u2013106 (2008)"},{"key":"33_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2010-260","volume":"100","author":"V. B\u00e1r\u00e1ny","year":"2010","unstructured":"B\u00e1r\u00e1ny, V., Kaiser, \u0141., Rabinovich, A.: Expressing Cardinality Quantifiers in Monadic Second-Order Logic over Trees. Fundamenta Informaticae\u00a0100, 1\u201318 (2010)","journal-title":"Fundamenta Informaticae"},{"key":"33_CR13","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)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44522-8_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:29:24Z","timestamp":1746332964000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44522-8_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662445211","9783662445228"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44522-8_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}