{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:33:07Z","timestamp":1761597187646,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540229407"},{"type":"electronic","value":"9783540286448"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"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":[[2004]]},"DOI":"10.1007\/978-3-540-28644-8_9","type":"book-chapter","created":{"date-parts":[[2010,2,25]],"date-time":"2010-02-25T19:48:13Z","timestamp":1267127293000},"page":"131-145","source":"Crossref","is-referenced-by-count":3,"title":["Characterizing EF and EX Tree Logics"],"prefix":"10.1007","author":[{"given":"Miko\u0142aj","family":"Boja\u0144czyk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Walukiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/4904.4999","volume":"33","author":"E.A. Emerson","year":"1986","unstructured":"Emerson, E.A., Halpern, J.Y.: \u2018Sometimes\u2019 and \u2018not never\u2019 revisited: on branching versus linear time temporal logic. Journal of the ACM\u00a033(1), 151\u2013178 (1986)","journal-title":"Journal of the ACM"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s002360050074","volume":"34","author":"J. Esparza","year":"1997","unstructured":"Esparza, J.: Decidability of model-checking for infinite-state concurrent systems. Acta Informatica\u00a034, 85\u2013107 (1997)","journal-title":"Acta Informatica"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"M. Fischer","year":"1979","unstructured":"Fischer, M., Ladner, R.: Propositional dynamic logic of regular programs. Journal of Computer and System Sciences\u00a018, 194\u2013211 (1979)","journal-title":"Journal of Computer and System Sciences"},{"key":"9_CR4","unstructured":"Franceschet, M., Afanasiev, L., de Rijke, M., Marx, M.: CTL model checking for processing simple XPath queries. In: Temporal Presentation and Reasoning"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Koch, C., Gottlob, G.: Monadic queries over tree-structured data. In: Logic in Computer Science, pp. 189\u2013202 (2002)","DOI":"10.1109\/LICS.2002.1029828"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/3-540-18088-5_21","volume-title":"Automata, Languages and Programming","author":"T. Hafer","year":"1987","unstructured":"Hafer, T., Thomas, W.: Computation tree logic CTL and path quantifiers in the monadic theory of the binary tree. In: Ottmann, T. (ed.) ICALP 1987. LNCS, vol.\u00a0267, pp. 260\u2013279. Springer, Heidelberg (1987)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/BFb0035840","volume-title":"STACS 88","author":"U. Heuter","year":"1988","unstructured":"Heuter, U.: First-order properties of trees, star-free expressions, and aperiodicity. In: Cori, R., Wirsing, M. (eds.) STACS 1988. LNCS, vol.\u00a0294, pp. 136\u2013148. Springer, Heidelberg (1988)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-45793-3_2","volume-title":"Computer Science Logic","author":"F. Neven","year":"2002","unstructured":"Neven, F.: Automata, logic, and XML. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol.\u00a02471, pp. 2\u201326. Springer, Heidelberg (2002)"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Niwi\u0144ski, D.: Fixed points vs. infinte generation. In: Logic in Computer Science, pp. 402\u2013409 (1988)","DOI":"10.1109\/LICS.1988.5137"},{"key":"9_CR10","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":"9_CR11","series-title":"Lecture Notes in Computer Science","first-page":"125","volume-title":"TAPSOFT \u201995: Theory and Practice of Software Development","author":"A. Potthoff","year":"1995","unstructured":"Potthoff, A.: First-order logic on finite trees. In: Mosses, P.D., Schwartzbach, M.I., Nielsen, M. (eds.) CAAP 1995, FASE 1995, and TAPSOFT 1995. LNCS, vol.\u00a0915, pp. 125\u2013139. Springer, Heidelberg (1995)"},{"key":"9_CR12","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":"9_CR13","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1137\/0219027","volume":"19","author":"H. Seidl","year":"1990","unstructured":"Seidl, H.: Deciding equivalence of finite tree automata. SIAM Journal of Computing\u00a019, 424\u2013437 (1990)","journal-title":"SIAM Journal of Computing"},{"key":"9_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0289-9","volume-title":"Finite Automata, Formal Languages, and Circuit Complexity","author":"H. Straubing","year":"1994","unstructured":"Straubing, H.: Finite Automata, Formal Languages, and Circuit Complexity. Birkh\u00e4user, Boston (1994)"},{"issue":"1","key":"9_CR15","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF01691346","volume":"2","author":"J.W. Thatcher","year":"1968","unstructured":"Thatcher, J.W., Wright, J.B.: Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory\u00a02(1), 57\u201381 (1968)","journal-title":"Mathematical Systems Theory"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/3-540-44450-5_10","volume-title":"FST TCS 2000: Foundations of Software Technology and Theoretical Science","author":"I. Walukiewicz","year":"2000","unstructured":"Walukiewicz, I.: Model checking CTL properties of pushdown systems. In: Kapoor, S., Prasad, S. (eds.) FST TCS 2000. LNCS, vol.\u00a01974, pp. 127\u2013138. Springer, Heidelberg (2000)"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Walukiewicz, I.: Deciding low levels of tree-automata hierarchy. In: Workshop on Logic, Language, Information and Computation. Electronic Notes in Theoretical Computer Science, vol.\u00a067 (2002)","DOI":"10.1016\/S1571-0661(04)80541-3"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/3-540-49116-3_3","volume-title":"STACS 99","author":"T. Wilke","year":"1999","unstructured":"Wilke, T.: Classifying discrete temporal properties. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 32\u201346. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2004 - Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28644-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T22:00:04Z","timestamp":1739916004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28644-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540229407","9783540286448"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28644-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}