{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:17:17Z","timestamp":1760203037728,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662531310"},{"type":"electronic","value":"9783662531327"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-53132-7_26","type":"book-chapter","created":{"date-parts":[[2016,7,20]],"date-time":"2016-07-20T01:25:06Z","timestamp":1468977906000},"page":"319-331","source":"Crossref","is-referenced-by-count":0,"title":["Unambiguous B\u00fcchi Is Weak"],"prefix":"10.1007","author":[{"given":"Henryk","family":"Michalewski","sequence":"first","affiliation":[]},{"given":"Micha\u0142","family":"Skrzypczak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,21]]},"reference":[{"issue":"4\/5","key":"26_CR1","first-page":"329","volume":"33","author":"A Arnold","year":"1999","unstructured":"Arnold, A.: The $$\\mu $$ -calculus alternation-depth hierarchy is strict on binary trees. ITA 33(4\/5), 329\u2013340 (1999)","journal-title":"ITA"},{"issue":"1\u20132","key":"26_CR2","first-page":"265","volume":"333","author":"A Arnold","year":"2005","unstructured":"Arnold, A., Santocanale, L.: Ambiguous classes in $$\\mu $$ -calculi hierarchies. TCS 333(1\u20132), 265\u2013296 (2005)","journal-title":"TCS"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BFb0028547","volume-title":"STACS 98","author":"J Bradfield","year":"1998","unstructured":"Bradfield, J.: Simplifying the modal mu-calculus alternation hierarchy. In: Morvan, M., Meinel, C., Krob, D. (eds.) STACS 1998. LNCS, vol. 1373, pp. 39\u201349. Springer, Heidelberg (1998)"},{"key":"26_CR4","first-page":"662","volume":"8","author":"A Carayol","year":"2010","unstructured":"Carayol, A., L\u00f6ding, C., Niwi\u0144ski, D., Walukiewicz, I.: Choice functions and well-orderings over the infinite binary tree. Cent. Eur. J. Math. 8, 662\u2013682 (2010)","journal-title":"Cent. Eur. J. Math."},{"key":"26_CR5","unstructured":"Colcombet, T.: Forms of determinism for automata (invited talk). In: STACS, pp. 1\u201323 (2012)"},{"key":"26_CR6","unstructured":"Colcombet, T., Kuperberg, D., L\u00f6ding, C., Vanden Boom, M.: Deciding the weak definability of B\u00fcchi definable tree languages. In: CSL, pp. 215\u2013230 (2013)"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Facchini, A., Murlak, F., Skrzypczak, M.: Rabin-Mostowski index problem: a step beyond deterministic automata. In: LICS, pp. 499\u2013508 (2013)","DOI":"10.1109\/LICS.2013.56"},{"issue":"2\u20133","key":"26_CR8","doi-asserted-by":"crossref","first-page":"287","DOI":"10.3233\/FI-2009-151","volume":"95","author":"O Finkel","year":"2009","unstructured":"Finkel, O., Simonnet, P.: On recognizable tree languages beyond the Borel hierarchy. Fundam. Informaticae 95(2\u20133), 287\u2013303 (2009)","journal-title":"Fundam. Informaticae"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Hummel, S.: Unambiguous tree languages are topologically harder than deterministic ones. In: GandALF, pp. 247\u2013260 (2012)","DOI":"10.4204\/EPTCS.96.19"},{"key":"26_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4190-4","volume-title":"Classical Descriptive Set Theory","author":"A Kechris","year":"1995","unstructured":"Kechris, A.: Classical Descriptive Set Theory. Springer, New York (1995)"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/3-540-49116-3_43","volume-title":"STACS 99","author":"O Kupferman","year":"1999","unstructured":"Kupferman, O., Vardi, M.Y.: The weakness of self-complementation. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 455\u2013466. Springer, Heidelberg (1999)"},{"issue":"4","key":"26_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2168\/LMCS-4(4:15)2008","volume":"4","author":"F Murlak","year":"2008","unstructured":"Murlak, F.: The Wadge hierarchy of deterministic tree languages. Log. Methods Comput. Sci. 4(4), 1\u201344 (2008)","journal-title":"Log. Methods Comput. Sci."},{"key":"26_CR13","unstructured":"Niwi\u0144ski, D., Walukiewicz, I.: Ambiguity problem for automata on infinite trees (1996, unpublished)"},{"key":"26_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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: Morvan, M., Meinel, C., Krob, D. (eds.) STACS 1998. LNCS, vol. 1373, pp. 320\u2013331. Springer, Heidelberg (1998)"},{"issue":"303","key":"26_CR15","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0304-3975(02)00452-8","volume":"1","author":"D Niwi\u0144ski","year":"2003","unstructured":"Niwi\u0144ski, D., Walukiewicz, I.: A gap property of deterministic tree languages. Theor. Comput. Sci. 1(303), 215\u2013231 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR16","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/j.entcs.2004.05.015","volume":"123","author":"D Niwi\u0144ski","year":"2005","unstructured":"Niwi\u0144ski, D., Walukiewicz, I.: Deciding nondeterministic hierarchy of deterministic tree automata. Electr. Notes Theor. Comput. Sci. 123, 195\u2013208 (2005)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Weakly definable relations and special automata. In: Proceedings of the Symposium on Mathematical Logic and Foundations of Set Theory, pp. 1\u201323. North-Holland (1970)","DOI":"10.1016\/S0049-237X(08)71929-3"},{"key":"26_CR18","first-page":"389","volume-title":"Handbook of Formal Languages","author":"W Thomas","year":"1996","unstructured":"Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 389\u2013455. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53132-7_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,3]],"date-time":"2022-07-03T09:42:50Z","timestamp":1656841370000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53132-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662531310","9783662531327"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53132-7_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}