{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:05:44Z","timestamp":1725566744869},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540282310"},{"type":"electronic","value":"9783540318972"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11538363_30","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:35:33Z","timestamp":1127828133000},"page":"428-441","source":"Crossref","is-referenced-by-count":7,"title":["On Deciding Topological Classes of Deterministic Tree Languages"],"prefix":"10.1007","author":[{"given":"Filip","family":"Murlak","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0304-3975(97)00217-X","volume":"195","author":"J.C. Bradfield","year":"1998","unstructured":"Bradfield, J.C.: The modal mu-calculus alternation hierarchy is strict. Theoret. Comput. Sci.\u00a0195, 133\u2013153 (1998)","journal-title":"Theoret. Comput. Sci."},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0304-3975(96)00228-9","volume":"178","author":"A. Browne","year":"1997","unstructured":"Browne, A., Clarke, E.M., Jha, S., Long, D.E., Marrero, W.: An improved algorithm for the evaluation of fixpoint expressions. Theoret. Comput. Sci.\u00a0178, 237\u2013255 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"30_CR3","first-page":"328","volume-title":"Proc. FoCS 1988","author":"E.A. Emerson","year":"1988","unstructured":"Emerson, E.A., Jutla, C.S.: The complexity of tree automata and logics of programs. In: Proc. FoCS 1988, pp. 328\u2013337. IEEE Computer Society Press, Los Alamitos (1988)"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/10722167_18","volume-title":"Computer Aided Verification","author":"M. Jurdzi\u0144ski","year":"2000","unstructured":"Jurdzi\u0144ski, M., V\u00f6ge, J.: A discrete strategy improvement algorithm for solving parity games. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 202\u2013215. Springer, Heidelberg (2000)"},{"key":"30_CR5","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4190-4","volume-title":"Classical Descriptive Set Theory","author":"A.S. Kechris","year":"1995","unstructured":"Kechris, A.S.: Classical Descriptive Set Theory. Graduate Texts in Mathematics, vol.\u00a0156. Springer, Heidelberg (1995)"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Kupferman, O., Safra, S., Vardi, M.: Relating Word and Tree Automata. In: 11th IEEE Symp. on Logic in Comput. Sci., pp. 322\u2013332 (1996)","DOI":"10.1109\/LICS.1996.561360"},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/3-540-61440-0_119","volume-title":"Automata, Languages and Programming","author":"G. Lenzi","year":"1996","unstructured":"Lenzi, G.: A hierarchy theorem for the mu-calculus. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol.\u00a01099, pp. 87\u2013109. Springer, Heidelberg (1996)"},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0304-3975(91)90283-8","volume":"83","author":"A.W. Mostowski","year":"1991","unstructured":"Mostowski, A.W.: Hierarchies of weak automata and weak monadic formulas. Theoret. Comput. Sci.\u00a083, 323\u2013335 (1991)","journal-title":"Theoret. Comput. Sci."},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1007\/3-540-16761-7_96","volume-title":"Automata, Languages and Programming","author":"D. Niwi\u0144ski","year":"1986","unstructured":"Niwi\u0144ski, D.: On fixed point clones. In: Kott, L. (ed.) ICALP 1986. LNCS, vol.\u00a0226, pp. 464\u2013473. Springer, Heidelberg (1986)"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/BFb0028571","volume-title":"STACS 98","author":"D. Niwi\u0144ski","year":"1998","unstructured":"Niwi\u0144ski, D., Walukiewicz, I.: Relating hierarchies of word and tree automata. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol.\u00a01373, pp. 320\u2013331. Springer, Heidelberg (1998)"},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0304-3975(02)00452-8","volume":"303","author":"D. Niwi\u0144ski","year":"2003","unstructured":"Niwi\u0144ski, D., Walukiewicz, I.: A gap property of deterministic tree languages. Theoret. Comput. Sci.\u00a0303, 215\u2013231 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Niwi\u0144ski, D., Walukiewicz, I.: Deciding nondeterministic hierarchy of deterministic tree automata. In: Proc. WoLLiC 2004(2004) (to appear in Electronic Notes in Theoretical Computer Science)","DOI":"10.1016\/j.entcs.2004.05.015"},{"key":"30_CR13","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 \u03bc-calculus. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 531\u2013540. Springer, Heidelberg (1999)"},{"key":"30_CR14","first-page":"1","volume":"141","author":"M.O. Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Amer. Soc.\u00a0141, 1\u201335 (1969)","journal-title":"Trans. Amer. Soc."},{"key":"30_CR15","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0020-0190(96)00130-5","volume":"59","author":"H. Seidl","year":"1996","unstructured":"Seidl, H.: Fast and simple nested fixpoints. Information Processing Letters\u00a059, 303\u2013308 (1996)","journal-title":"Information Processing Letters"},{"key":"30_CR16","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/0304-3975(93)90030-W","volume":"112","author":"J. Skurczy\u0144ski","year":"1993","unstructured":"Skurczy\u0144ski, J.: The Borel hierarchy is infinite in the class of regular sets of trees. Theoret. Comput. Sci.\u00a0112, 413\u2013418 (1993)","journal-title":"Theoret. Comput. Sci."},{"key":"30_CR17","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume-title":"Handbook of Formal Languages","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a03, pp. 389\u2013455. Springer, Heidelberg (1997)"},{"key":"30_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/3-540-45022-X_56","volume-title":"Automata, Languages and Programming","author":"T.F. Urba\u0144ski","year":"2000","unstructured":"Urba\u0144ski, T.F.: On deciding if deterministic Rabin language is in B\u00fcchi class. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 663\u2013674. Springer, Heidelberg (2000)"},{"key":"30_CR19","first-page":"473","volume":"13","author":"K. Wagner","year":"1977","unstructured":"Wagner, K.: Eine topologische Charakterisierung einiger Klassen regul\u00e4rer Folgenmengen. J. Inf. Process. Cybern. EIK\u00a013, 473\u2013487 (1977)","journal-title":"J. Inf. Process. Cybern. EIK"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11538363_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:13:40Z","timestamp":1605644020000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11538363_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540282310","9783540318972"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11538363_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}