{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:09:39Z","timestamp":1761610179434,"version":"build-2065373602"},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3954,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s1571-0661(04)80541-3","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"61-75","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["Deciding low levels of tree-automata hierarchy"],"prefix":"10.1016","volume":"67","author":[{"given":"Igor","family":"Walukiewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80541-3_NEWBIB1","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1051\/ita:1999121","article-title":"The mu-calculus alternation-depth hierarchy is strict on binary trees","volume":"33","author":"Arnold","year":"1999","journal-title":"RAIRO\u2013Theoretical Informatics and Applications"},{"key":"10.1016\/S1571-0661(04)80541-3_NEWBIB2","article-title":"Fixed point characterisation of weak monadic logic definable sets of trees","volume":"159\u2013188","author":"Arnold","year":"1992"},{"key":"10.1016\/S1571-0661(04)80541-3_NEWBIB3","series-title":"Studies in Logic 146","article-title":"\u201cThe Rudiments of the Mu-Calculus,\u201d","author":"Arnold","year":"2001"},{"key":"10.1016\/S1571-0661(04)80541-3_NEWBIB4","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":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80541-3_NEWBIB5","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1051\/ita:1999122","article-title":"Fixpoint alternation: Arithmetic, transition systems, and the binary tree","volume":"33","author":"Bradfield","year":"1999","journal-title":"RAIRO\u2013Theoretical Informatics and Applications"},{"key":"10.1016\/S1571-0661(04)80541-3_NEWBIB6","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-Theoretical Informatics and Applications"},{"key":"10.1016\/S1571-0661(04)80541-3_NEWBIB7","first-page":"385","article-title":"On model-checking for fragments of \u03bc-calculus","volume":"697","author":"Emerson","year":"1993","journal-title":"CAV'93, LNCS"},{"key":"10.1016\/S1571-0661(04)80541-3_NEWBIB8","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":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80541-3_NEWBIB9","doi-asserted-by":"crossref","unstructured":"Niwi\u0144ski, D., On fixed-point clones, in: Proc. 13th ICALP, LNCS 226, 1986, pp. 464\u2013473.","DOI":"10.1007\/3-540-16761-7_96"},{"key":"10.1016\/S1571-0661(04)80541-3_NEWBIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(97)00039-X","article-title":"Fixed point characterization of infinite behaviour of finite state systems","volume":"189","author":"Niwi\u0144ski","year":"1997","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80541-3_NEWBIB11","doi-asserted-by":"crossref","unstructured":"Niwi\u0144ski D. and I. Walukiewicz, Relating hierarchies of word and tree automata, in: STACS'98, LNCS 1373 (1998).","DOI":"10.1007\/BFb0028571"},{"key":"10.1016\/S1571-0661(04)80541-3_NEWBIB12","doi-asserted-by":"crossref","unstructured":"Niwi\u0144ski D. and I. Walukiewicz, A gap property of deterministic tree languages (2002), to appear in TCS.","DOI":"10.1016\/S0304-3975(02)00452-8"},{"key":"10.1016\/S1571-0661(04)80541-3_NEWBIB13","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1007\/3-540-49116-3_50","article-title":"Eliminating recursion in the mu-calculus","volume":"1563","author":"Otto","year":"1999","journal-title":"STACS'99, LNCS"},{"key":"10.1016\/S1571-0661(04)80541-3_NEWBIB14","doi-asserted-by":"crossref","unstructured":"Park, D., Concurrency and automata on inifinte sequences, in: 5th Gi Conference on Theoretical Computer Science, LNCS 104, 1981, pp. 167\u2013183.","DOI":"10.1007\/BFb0017309"},{"key":"10.1016\/S1571-0661(04)80541-3_NEWBIB15","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. Math. Soc"},{"key":"10.1016\/S1571-0661(04)80541-3_NEWBIB16","first-page":"1","article-title":"Weakly definable relations and special automata","author":"Rabin","year":"1970","journal-title":"Mathematical Logic in Foundations of Set Theory"},{"key":"10.1016\/S1571-0661(04)80541-3_NEWBIB17","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 Journal of Computing"},{"key":"10.1016\/S1571-0661(04)80541-3_NEWBIB18","doi-asserted-by":"crossref","unstructured":"Urba'nski T., On deciding if deterministic rabin language is in b\u00fcchi class, in: ICALP'00, LNCS, 2000, to appear.","DOI":"10.1007\/3-540-45022-X_56"},{"key":"10.1016\/S1571-0661(04)80541-3_NEWBIB19","first-page":"473","article-title":"Eine topologische Charakterisierung einiger Klassen regul\u00e4rer Folgenmengen","volume":"13","author":"Wagner","year":"1977","journal-title":"J. Inf. Process. Cybern. EIK"},{"key":"10.1016\/S1571-0661(04)80541-3_NEWBIB20","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":"Information and Computation"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805413?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805413?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:05:26Z","timestamp":1761609926000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104805413"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":20,"alternative-id":["S1571066104805413"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80541-3","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2002,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Deciding low levels of tree-automata hierarchy","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)80541-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}