{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:31:48Z","timestamp":1742938308768,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540875307"},{"type":"electronic","value":"9783540875314"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87531-4_29","type":"book-chapter","created":{"date-parts":[[2008,8,30]],"date-time":"2008-08-30T08:40:53Z","timestamp":1220085653000},"page":"401-415","source":"Crossref","is-referenced-by-count":4,"title":["Characterization of Logics over Ranked Tree Languages"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Place","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/978-3-540-31856-9_27","volume-title":"STACS 2005","author":"M. Benedikt","year":"2005","unstructured":"Benedikt, M., Segoufin, L.: Regular tree languages definable in FO. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 327\u2013339. Springer, Heidelberg (2005)"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Boja\u0144czyk, M.: Two-way unary temporal logic over trees. In: 22nd IEEE Symposium on Logic in Computer Science, pp. 121\u2013130 (2007)","DOI":"10.1109\/LICS.2007.51"},{"key":"29_CR3","unstructured":"Boja\u0144czyk, M., Segoufin, L.: Tree languages defined in first-order logic with one quantifier alternation (2008)"},{"issue":"2-3","key":"29_CR4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.tcs.2006.01.018","volume":"358","author":"M. Boja\u0144czyk","year":"2006","unstructured":"Boja\u0144czyk, M., Walukiewicz, I.: Characterizing EF and EX tree logics. Theoritical Compututer Science\u00a0358(2-3), 255\u2013272 (2006)","journal-title":"Theoritical Compututer Science"},{"key":"29_CR5","first-page":"107","volume-title":"Automata and Logic: History and Perspectives","author":"M. Boja\u0144czyk","year":"2007","unstructured":"Boja\u0144czyk, M., Walukiewicz, I.: Forest algebras. In: Automata and Logic: History and Perspectives, pp. 107\u2013132. Amsterdam University Press, Amsterdam (2007)"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y., Etessami, K., Wilke, T.: First-order logic with two variables and unary temporal logic. In: 12th IEEE Symposium on Logic in Computer Science, pp. 228\u2013235 (1997)","DOI":"10.7146\/brics.v4i5.18784"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Segoufin, L., Boja\u0144czyk, M., Straubing, H.: Piecewise testable tree languages (2008)","DOI":"10.1109\/LICS.2008.46"},{"key":"29_CR8","volume-title":"Counter-Free Automata","author":"R. McNaughton","year":"1971","unstructured":"McNaughton, R., Papert, S.: Counter-Free Automata. MIT Press, Cambridge (1971)"},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","volume":"8","author":"M.P. Sch\u00fctzenberger","year":"1965","unstructured":"Sch\u00fctzenberger, M.P.: On finite monoids having only trivial subgroups. Information and Control\u00a08, 190\u2013194 (1965)","journal-title":"Information and Control"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Th\u00e9rien, D., Wilke, T.: Over words, two variables are as powerful as one quantifier alternation. In: 30th ACM Symposium on Theory of Computing, pp. 234\u2013240 (1998)","DOI":"10.1145\/276698.276749"},{"issue":"1","key":"29_CR11","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(95)00131-X","volume":"154","author":"T. Wilke","year":"1996","unstructured":"Wilke, T.: An algebraic characterization of frontier testable tree languages. Theoretical Computer Science\u00a0154(1), 85\u2013106 (1996)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87531-4_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T05:14:13Z","timestamp":1715058853000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87531-4_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540875307","9783540875314"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87531-4_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}