{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T05:23:32Z","timestamp":1738301012224,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540708438"},{"type":"electronic","value":"9783540708445"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70844-5_20","type":"book-chapter","created":{"date-parts":[[2008,7,22]],"date-time":"2008-07-22T09:19:29Z","timestamp":1216718369000},"page":"191-200","source":"Crossref","is-referenced-by-count":0,"title":["Games for Temporal Logics on Trees"],"prefix":"10.1007","author":[{"given":"Z.","family":"\u00c9sik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sz.","family":"Iv\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1145\/772062.772064","volume":"4","author":"M. Adler","year":"2003","unstructured":"Adler, M., Immerman, N.: An n! lower bound on formula size. ACM Transactions on Computational Logic\u00a04, 296\u2013314 (2003)","journal-title":"ACM Transactions on Computational Logic"},{"key":"20_CR2","first-page":"344","volume-title":"14th Symposium on Logic in Computer Science","author":"A. Baziramwabo","year":"1999","unstructured":"Baziramwabo, A., McKenzie, P., Th\u00e9rien, D.: Modular Temporal Logic. In: 14th Symposium on Logic in Computer Science, pp. 344\u2013351. IEEE Computer Society, Los Alamitos (1999)"},{"key":"20_CR3","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)"},{"issue":"2-3","key":"20_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. Theoretical Computer Science\u00a0358(2-3), 255\u2013272 (2006)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"20_CR5","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0167-6423(83)90017-5","volume":"2","author":"E.A. Emerson","year":"1982","unstructured":"Emerson, E.A., Clarke, E.M.: Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons. Science of Computer Programming\u00a02(3), 241\u2013266 (1982)","journal-title":"Science of Computer Programming"},{"issue":"1-2","key":"20_CR6","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.tcs.2006.01.034","volume":"356","author":"Z. \u00c9sik","year":"2006","unstructured":"\u00c9sik, Z.: Characterizing CTL-like logics on finite trees. Theoretical Computer Science\u00a0356(1-2), 136\u2013152 (2006)","journal-title":"Theoretical Computer Science"},{"key":"20_CR7","unstructured":"\u00c9sik, Z.: An algebraic characterization of temporal logics on finite trees, Parts 1,2,3. In: 1st International Conference on Algebraic Informatics, Thessaloniki, pp. 53\u201377, 79\u201399, 101\u2013111. Aristotle University of Thessaloniki (2005)"},{"issue":"1-2","key":"20_CR8","doi-asserted-by":"crossref","first-page":"61","DOI":"10.3233\/FUN-2008-821-205","volume":"82","author":"Z. \u00c9sik","year":"2008","unstructured":"\u00c9sik, Z., Iv\u00e1n, S.: Products of tree automata with an application to temporal logic. Fundamenta Informaticae\u00a082(1-2), 61\u201378 (2008)","journal-title":"Fundamenta Informaticae"},{"issue":"1-2","key":"20_CR9","doi-asserted-by":"crossref","first-page":"79","DOI":"10.3233\/FUN-2008-821-206","volume":"82","author":"Z. \u00c9sik","year":"2008","unstructured":"\u00c9sik, Z., Iv\u00e1n, S.: Some varieties of finite tree automata related to restricted temporal logics. Fundamenta Informaticae\u00a082(1-2), 79\u2013103 (2008)","journal-title":"Fundamenta Informaticae"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1109\/LICS.1996.561310","volume-title":"11th Annual IEEE Symposium on Logic in Computer Science","author":"K. Etessami","year":"1996","unstructured":"Etessami, K., Wilke, T.: An until hierarchy for temporal logic. In: 11th Annual IEEE Symposium on Logic in Computer Science, New Brunswick, New Jersey, pp. 108\u2013117. IEEE Computer Society Press, Los Alamitos (1996)"},{"key":"20_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-77487-9","volume-title":"Universal Algebra","author":"G. Gr\u00e4tzer","year":"1979","unstructured":"Gr\u00e4tzer, G.: Universal Algebra, 2nd edn. Springer, Heidelberg (1979)","edition":"2"},{"key":"20_CR12","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)"},{"issue":"3","key":"20_CR13","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1142\/S0129054102001151","volume":"13","author":"J.G. Henriksen","year":"2002","unstructured":"Henriksen, J.G.: An Expressive Extension of TLC. International Journal of Foundations of Computer Science\u00a013(3), 341\u2013360 (2002)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"1","key":"20_CR14","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0304-3975(94)90270-4","volume":"126","author":"A. Potthoff","year":"1994","unstructured":"Potthoff, A.: Modulo-counting quantifiers over finite trees. Theoretical Computer Science\u00a0126(1), 97\u2013112 (1994)","journal-title":"Theoretical Computer Science"},{"key":"20_CR15","unstructured":"Steinby, M.: Syntactic algebras and varieties of recognizable sets. In: Les arbres en alg\u00e8bre et en programmation (4\u00e9me Colloq., 1979), Lille, pp. 226\u2013240. Univ. Lille I (1979)"},{"issue":"1-2","key":"20_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(98)00010-3","volume":"205","author":"M. Steinby","year":"1998","unstructured":"Steinby, M.: General varieties of tree languages. Theoretical Computer Science\u00a0205(1-2), 1\u201343 (1998)","journal-title":"Theoretical Computer Science"},{"issue":"1-3","key":"20_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2007.02.006","volume":"377","author":"S. Salehi","year":"2007","unstructured":"Salehi, S., Steinby, M.: Tree algebras and varieties of tree languages. Theoretical Computer Science\u00a0377(1-3), 1\u201324 (2007)","journal-title":"Theoretical Computer Science"},{"key":"20_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0289-9","volume-title":"Finite Automata, Formal Logic, and Circuit Complexity","author":"H. Straubing","year":"1994","unstructured":"Straubing, H.: Finite Automata, Formal Logic, and Circuit Complexity. Birkh\u00e4user, Basel (1994)"},{"key":"20_CR19","first-page":"31","volume-title":"Ninth colloquium on trees in algebra and programming","author":"W. Thomas","year":"1984","unstructured":"Thomas, W.: Logical aspects in the study of tree languages. In: Ninth colloquium on trees in algebra and programming, Bordeaux, pp. 31\u201349. Cambridge University Press, Cambridge (1984)"},{"key":"20_CR20","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.ipl.2006.11.012","volume":"102","author":"Z. Wu","year":"2007","unstructured":"Wu, Z.: A note on the characterization of TL(EF). Information Processing Letters\u00a0102, 48\u201354 (2007)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Implementation and Applications of Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70844-5_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T03:56:26Z","timestamp":1738295786000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70844-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540708438","9783540708445"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70844-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}