{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:13:58Z","timestamp":1743009238637,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"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_6","type":"book-chapter","created":{"date-parts":[[2009,7,2]],"date-time":"2009-07-02T11:05:04Z","timestamp":1246532704000},"page":"67-78","source":"Crossref","is-referenced-by-count":5,"title":["Boundedness of Monadic Second-Order Formulae over Finite Words"],"prefix":"10.1007","author":[{"given":"Achim","family":"Blumensath","sequence":"first","affiliation":[]},{"given":"Martin","family":"Otto","sequence":"additional","affiliation":[]},{"given":"Mark","family":"Weyer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"521","DOI":"10.2307\/2273529","volume":"43","author":"J. Barwise","year":"1978","unstructured":"Barwise, J., Moschovakis, Y.N.: Global inductive definability. The Journal of Symbolic Logic\u00a043, 521\u2013534 (1978)","journal-title":"The Journal of Symbolic Logic"},{"key":"6_CR2","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 \u03bc-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":"6_CR3","doi-asserted-by":"crossref","unstructured":"Cosmadakis, S.S., Gaifman, H., Kanellakis, P.C., Vardi, M.Y.: Decidable optimization problems for database logic programs. In: Proc. 20th Annual ACM Symposium on Theory of Computing, STOC 1988, pp. 477\u2013490 (1988)","DOI":"10.1145\/62212.62259"},{"key":"6_CR4","volume-title":"Finite Model Theory","author":"H.-D. Ebbinghaus","year":"1995","unstructured":"Ebbinghaus, H.-D., Flum, J.: Finite Model Theory. Springer, Heidelberg (1995)"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"72","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\u00a072, 72\u201378 (1990)","journal-title":"Theoretical Computer Science"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0743-1066(95)00051-K","volume":"25","author":"G. Hillebrand","year":"1995","unstructured":"Hillebrand, G., Kanellakis, P., Mairson, H., Vardi, M.: Undecidable boundedness problems for datalog programs. The Journal of Logic Programming\u00a025, 163\u2013190 (1995)","journal-title":"The Journal of Logic Programming"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/978-3-540-73420-8_50","volume-title":"Automata, Languages and Programming","author":"S. Kreutzer","year":"2007","unstructured":"Kreutzer, S., Otto, M., Schweikardt, N.: Boundedness of monadic FO over acyclic structures. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 571\u2013582. Springer, Heidelberg (2007)"},{"key":"6_CR8","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., Podolskiy, V.: The limitedness problem on distance automata: Hashiguchi\u2019s method revisited. Theoretical Computer Science\u00a0310, 147\u2013158 (2004)","journal-title":"Theoretical Computer Science"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/3-540-49116-3_50","volume-title":"STACS 99","author":"M. Otto","year":"1999","unstructured":"Otto, M.: Eliminating recursion in the \u03bc-calculus. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 531\u2013540. Springer, Heidelberg (1999)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Otto, M.: The boundedness problem for monadic universal first-order logic. In: Proc. 21th IEEE Symposium on Logic in Computer Science, LICS 2006, pp.\u00a037\u201346 (2006)","DOI":"10.1109\/LICS.2006.50"}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T20:20:39Z","timestamp":1552076439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02930-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029295","9783642029301"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02930-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}