{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T07:44:17Z","timestamp":1764402257370},"reference-count":13,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1016\/s0020-0190(02)00285-5","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T20:29:59Z","timestamp":1034281799000},"page":"181-187","source":"Crossref","is-referenced-by-count":7,"title":["Complexity of weak acceptance conditions in tree automata"],"prefix":"10.1016","volume":"84","author":[{"given":"Jakub","family":"Neumann","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Szepietowski","sequence":"additional","affiliation":[]},{"given":"Igor","family":"Walukiewicz","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(02)00285-5_BIB001","series-title":"Workshop on Logics of Programs","first-page":"79","article-title":"Automata, tableaux, and temporal logics","author":"Emerson","year":"1985"},{"key":"10.1016\/S0020-0190(02)00285-5_BIB002","series-title":"29th IEEE Symposium on Foundations of Computer Science","first-page":"368","article-title":"The complexity of tree automata and logics of programs","author":"Emerson","year":"1988"},{"key":"10.1016\/S0020-0190(02)00285-5_BIB003","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/0022-0000(81)90039-8","article-title":"Number of quantifiers is better than number of tape cells","volume":"22","author":"Immerman","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(02)00285-5_BIB004","series-title":"LICS'92","first-page":"382","article-title":"Progress measures, immediate determinacy and a subset construction for tree automata","author":"Klarlund","year":"1992"},{"issue":"2","key":"10.1016\/S0020-0190(02)00285-5_BIB005","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1145\/333979.333987","article-title":"An automata-theoretic approach to branching-time model checking","volume":"47","author":"Kupferman","year":"2000","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(02)00285-5_BIB006","first-page":"379","article-title":"Automatentheoretische und automatenfreie charakterisierungen topologischer klassen regul\u00e4rer folgenmengen","volume":"10","author":"Wagner","year":"1974","journal-title":"EIK"},{"key":"10.1016\/S0020-0190(02)00285-5_BIB007","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\/S0020-0190(02)00285-5_BIB008","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0304-3975(92)90076-R","article-title":"Alternating automata, the weak monadic theory of the tree and its complexity","volume":"97","author":"Muller","year":"1992","journal-title":"Theoret. Comput. Sci."},{"year":"1989","series-title":"Tree automata with weak acceptance conditions, PhD thesis","author":"Skurczy\u0144ski","key":"10.1016\/S0020-0190(02)00285-5_BIB009"},{"year":"1997","series-title":"A negative result for chain logic, Technical Report","author":"Skurczy\u0144ski","key":"10.1016\/S0020-0190(02)00285-5_BIB010"},{"key":"10.1016\/S0020-0190(02)00285-5_BIB011","doi-asserted-by":"crossref","first-page":"71","DOI":"10.5109\/13369","article-title":"Finite tree automata on infinite trees","volume":"21","author":"Miyano","year":"1985","journal-title":"Bull. Inform. Cybernet."},{"key":"10.1016\/S0020-0190(02)00285-5_BIB012","first-page":"133","article-title":"Automata on infinite objects","volume":"B","author":"Thomas","year":"1990"},{"key":"10.1016\/S0020-0190(02)00285-5_BIB013","article-title":"Languages, automata, and logic","volume":"3","author":"Thomas","year":"1997"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002002855?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002002855?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,14]],"date-time":"2021-05-14T17:28:38Z","timestamp":1621013318000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019002002855"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S0020019002002855"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00285-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}