{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T14:07:04Z","timestamp":1762351624997},"reference-count":29,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3735,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0304-3975(02)00452-8","type":"journal-article","created":{"date-parts":[[2003,1,21]],"date-time":"2003-01-21T19:54:09Z","timestamp":1043178849000},"page":"215-231","source":"Crossref","is-referenced-by-count":24,"title":["A gap property of deterministic tree languages"],"prefix":"10.1016","volume":"303","author":[{"given":"Damian","family":"Niwi\u0144ski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Walukiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00452-8_BIB1","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1051\/ita:1999121","article-title":"The \u03bc-calculus alternation-depth hierarchy is strict on binary trees","volume":"33","author":"Arnold","year":"1999","journal-title":"RAIRO-Theoret. Inform. Appl."},{"key":"10.1016\/S0304-3975(02)00452-8_BIB2","series-title":"Tree Automata and Languages","first-page":"159","article-title":"Fixed point characterization of weak monadic logic definable sets of trees","author":"Arnold","year":"1992"},{"key":"10.1016\/S0304-3975(02)00452-8_BIB3","series-title":"Rudiments of \u03bc-Calculus, Studies in Logic","author":"Arnold","year":"2001"},{"key":"10.1016\/S0304-3975(02)00452-8_BIB4","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0304-3975(97)00217-X","article-title":"The modal mu-calculus alternation hierarchy is strict","volume":"195","author":"Bradfield","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00452-8_BIB5","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1051\/ita:1999129","article-title":"Computing the Rabin index of a parity automaton","volume":"33","author":"Carton","year":"1999","journal-title":"RAIRO Theoret. Inform. Appl."},{"key":"10.1016\/S0304-3975(02)00452-8_BIB6","series-title":"Proc. CAV\u201993","first-page":"385","article-title":"On model-checking for fragments of \u03bc-calculus","volume":"Vol. 697","author":"Emerson","year":"1993"},{"key":"10.1016\/S0304-3975(02)00452-8_BIB7","series-title":"Tree Automata","author":"Gecs\u00e9g","year":"1984"},{"key":"10.1016\/S0304-3975(02)00452-8_BIB8","series-title":"Classical Descriptive Set Theory","author":"Kechris","year":"1994"},{"key":"10.1016\/S0304-3975(02)00452-8_BIB9","series-title":"Proc. ICALP \u201996","first-page":"87","article-title":"A hierarchy theorem for the mu-calculus","volume":"Vol. 1099","author":"Lenzi","year":"1996"},{"key":"10.1016\/S0304-3975(02)00452-8_BIB10","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","article-title":"Testing and generating infinite sequences by a finite automaton","volume":"9","author":"McNaughton","year":"1966","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(02)00452-8_BIB11","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0304-3975(91)90283-8","article-title":"Hierarchies of weak automata and weak monadic formulas","volume":"83","author":"Mostowski","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00452-8_BIB12","series-title":"13th ICALP\u201986","first-page":"275","article-title":"Alternating automata and a weak monadic theory of the tree and its complexity","volume":"Vol. 226","author":"Muller","year":"1986"},{"key":"10.1016\/S0304-3975(02)00452-8_BIB13","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(87)90133-2","article-title":"Alternating automata on infinite trees","volume":"54","author":"Muller","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00452-8_BIB14","unstructured":"D. Niwi\u0144ski, An example of non-Borel set of infinite trees recognizable by a Rabin automaton Manuscript, University of Warsaw, 1985, p. 9 (in Polish)."},{"key":"10.1016\/S0304-3975(02)00452-8_BIB15","doi-asserted-by":"crossref","unstructured":"D. Niwi\u0144ski, On fixed point clones, in: L. Kott (Ed.), 13th ICALP\u201986, Lecture Notes in Computer Science, Vol. 226, 1986, pp. 464\u2013473.","DOI":"10.1007\/3-540-16761-7_96"},{"key":"10.1016\/S0304-3975(02)00452-8_BIB16","series-title":"STACS\u201998","first-page":"320","article-title":"Relating hierarchies of word and tree automata","volume":"Vol. 1373","author":"Niwi\u0144ski","year":"1998"},{"key":"10.1016\/S0304-3975(02)00452-8_BIB17","series-title":"STACS\u201999","first-page":"531","article-title":"Eliminating recursion in the mu-calculus","volume":"Vol. 1563","author":"Otto","year":"1999"},{"key":"10.1016\/S0304-3975(02)00452-8_BIB18","doi-asserted-by":"crossref","unstructured":"D. Park, Concurrency and automata on infinite sequences, in: 5th G.I. Conf. on Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 104, Springer, Berlin, 1981, pp. 167\u2013183.","DOI":"10.1007\/BFb0017309"},{"key":"10.1016\/S0304-3975(02)00452-8_BIB19","first-page":"1","article-title":"Decidability of second-order theories and automata on infinite trees","volume":"141","author":"Rabin","year":"1969","journal-title":"Trans. Amer. Soc."},{"key":"10.1016\/S0304-3975(02)00452-8_BIB20","series-title":"Mathematical Logic and Foundation of Set Theory","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0049-237X(08)71929-3","article-title":"Weakly definable relations and special automata","author":"Rabin","year":"1970"},{"key":"10.1016\/S0304-3975(02)00452-8_BIB21","doi-asserted-by":"crossref","unstructured":"S. Safra, On the complexity of \u03c9-automata, in: 29th IEEE Symp. on Foundations of Computer Science, 1988.","DOI":"10.1109\/SFCS.1988.21948"},{"key":"10.1016\/S0304-3975(02)00452-8_BIB22","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1137\/0219027","article-title":"Deciding equivalence of finite tree automata","volume":"19","author":"Seidl","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(02)00452-8_BIB23","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/0304-3975(93)90030-W","article-title":"The Borel hierarchy is infinite in the class of regular sets of trees","volume":"112","author":"Skurczynski","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00452-8_BIB24","doi-asserted-by":"crossref","unstructured":"W. Thomas, A hierarchy of sets of infinite trees, in: Theoretical Computer Science Proc., Lecture Notes in Computer Science, Vol. 145, 1983, pp. 335\u2013342.","DOI":"10.1007\/BFb0036493"},{"key":"10.1016\/S0304-3975(02)00452-8_BIB25","first-page":"133","article-title":"Automata on infinite objects","volume":"Vol. B","author":"Thomas","year":"1990"},{"key":"10.1016\/S0304-3975(02)00452-8_BIB26","first-page":"389","article-title":"Languages, automata, and logic","volume":"Vol. 3","author":"Thomas","year":"1997"},{"key":"10.1016\/S0304-3975(02)00452-8_BIB27","series-title":"Proc. ICALP 2000","first-page":"663","article-title":"On deciding if deterministic Rabin language is in B\u00fcchi class","volume":"Vol. 1853","author":"Urba\u0144ski","year":"2000"},{"key":"10.1016\/S0304-3975(02)00452-8_BIB28","first-page":"473","article-title":"Eine topologische Charakterisierung einiger Klassen regul\u00e4rer Folgenmengen","volume":"13","author":"Wagner","year":"1977","journal-title":"J. Inform. Process. Cybern. EIK"},{"key":"10.1016\/S0304-3975(02)00452-8_BIB29","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1006\/inco.1996.0082","article-title":"Computing the Rabin index of a regular language of infinite words","volume":"130","author":"Wilke","year":"1996","journal-title":"Inform. and Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502004528?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502004528?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T06:13:55Z","timestamp":1583993635000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502004528"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0304397502004528"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00452-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}