{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T09:03:41Z","timestamp":1750323821881,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387081"},{"type":"electronic","value":"9783642387098"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44602-7_10","type":"book-chapter","created":{"date-parts":[[2014,8,23]],"date-time":"2014-08-23T01:18:40Z","timestamp":1408756720000},"page":"111-122","source":"Crossref","is-referenced-by-count":1,"title":["Subshifts, MSO Logic, and Collapsing Hierarchies"],"prefix":"10.1007","author":[{"given":"Ilkka","family":"T\u00f6rm\u00e4","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10440-013-9808-5","volume":"126","author":"N. Aubrun","year":"2013","unstructured":"Aubrun, N., Sablik, M.: Simulation of effective subshifts by two-dimensional subshifts of finite type. Acta Appl. Math.\u00a0126(1), 35\u201363 (2013)","journal-title":"Acta Appl. Math."},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Berger, R.: The undecidability of the domino problem. Mem. Amer. Math. Soc. No.\u00a066, 72 pages (1966)","DOI":"10.1090\/memo\/0066"},{"issue":"3","key":"10_CR3","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1016\/j.jcss.2011.11.001","volume":"78","author":"B. Durand","year":"2012","unstructured":"Durand, B., Romashchenko, A., Shen, A.: Fixed-point tile sets and their applications. J. Comput. System Sci.\u00a078(3), 731\u2013764 (2012)","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"10_CR4","doi-asserted-by":"publisher","first-page":"2011","DOI":"10.4007\/annals.2010.171.2011","volume":"171","author":"M. Hochman","year":"2010","unstructured":"Hochman, M., Meyerovitch, T.: A characterization of the entropies of multidimensional shifts of finite type. Ann. of Math (2)\u00a0171(3), 2011\u20132038 (2010)","journal-title":"Ann. of Math. (2)"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-642-02737-6_23","volume-title":"Developments in Language Theory","author":"E. Jeandel","year":"2009","unstructured":"Jeandel, E., Theyssier, G.: Subshifts, languages and logic. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol.\u00a05583, pp. 288\u2013299. Springer, Heidelberg (2009)"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2013.01.003","volume":"225","author":"E. Jeandel","year":"2013","unstructured":"Jeandel, E., Theyssier, G.: Subshifts as models for MSO logic. Inform. and Comput.\u00a0225, 1\u201315 (2013)","journal-title":"Inform. and Comput."},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Louidor, E., Marcus, B., Pavlov, R.: Independence entropy of \u2124 d -shift spaces. Acta Applicandae Mathematicae, 1\u201321 (2013)","DOI":"10.1007\/s10440-013-9819-2"},{"key":"10_CR8","unstructured":"Matz, O., Schweikardt, N.: Expressive power of monadic logics on words, trees, pictures, and graphs. In: Flum, J., Gr\u00e4del, E., Wilke, T. (eds.) Logic and Automata. Texts in Logic and Games, vol.\u00a02, pp. 531\u2013552. Amsterdam University Press (2008)"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Matz, O., Thomas, W.: The monadic quantifier alternation hierarchy over graphs is infinite. In: Twelfth Annual IEEE Symposium on Logic in Computer Science, pp. 236\u2013244. IEEE (1997)","DOI":"10.1109\/LICS.1997.614951"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Sacks, G.E.: Higher recursion theory. Perspectives in mathematical logic. Springer (1990)","DOI":"10.1007\/978-3-662-12013-2"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/BFb0028030","volume-title":"Computer Science Logic","author":"N. Schweikardt","year":"1998","unstructured":"Schweikardt, N.: The monadic quantifier alternation hierarchy over grids and pictures. In: Nielsen, M. (ed.) CSL 1997. LNCS, vol.\u00a01414, pp. 441\u2013460. Springer, Heidelberg (1998)"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"T\u00f6rm\u00e4, I.: Quantifier Extensions of Multidimensional Sofic Shifts. ArXiv e-prints (January 2014)","DOI":"10.1090\/proc\/12628"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/j.1538-7305.1961.tb03975.x","volume":"40","author":"H. Wang","year":"1961","unstructured":"Wang, H.: Proving theorems by pattern recognition II. Bell System Technical Journal\u00a040, 1\u201342 (1961)","journal-title":"Bell System Technical Journal"}],"container-title":["Lecture Notes in Computer Science","Advanced Information Systems Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44602-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T09:40:50Z","timestamp":1746351650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44602-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642387081","9783642387098"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44602-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}