{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:17Z","timestamp":1759637957289},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678236"},{"type":"electronic","value":"9783540449294"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44929-9_36","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T09:20:53Z","timestamp":1178356853000},"page":"521-535","source":"Crossref","is-referenced-by-count":32,"title":["Alternating Automata and Logics over Infinite Words"],"prefix":"10.1007","author":[{"given":"Christof","family":"Loding","sequence":"first","affiliation":[]},{"given":"Wolfgang","family":"Thomas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,24]]},"reference":[{"key":"36_CR1","unstructured":"J.R. B\u00fcchi. On a decision method in restricted second order arithmetic. In Proc. International Congress on Logic, Method and Philos. Sci. 1960, pages 1\u201311, 1962."},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"E.A. Emerson. Temporal and modal logic. In J. v. Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 995\u20131072. Elsevier Science Publishers, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50021-4"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"N. Klarlund. Progress measures for complementation of \u03c9-automata with applications to temporal logic. In Proc. 32nd FOCS, pages 358\u2013367, 1991.","DOI":"10.1109\/SFCS.1991.185391"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"O. Kupferman and M.Y. Vardi. Weak alternating automata are not that weak. In Proc. 5th Israeli Symposium on Theory of Computing and Systems, pages 147\u2013158. IEEE Computer Society Press, 1997.","DOI":"10.1109\/ISTCS.1997.595167"},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/BF01691063","volume":"3","author":"L.H. Landweber","year":"1969","unstructured":"L.H. Landweber. Decision poblems for \u03c9-automata. Math. System Theory, 3:376\u2013384, 1969.","journal-title":"Math. System Theory"},{"key":"36_CR6","unstructured":"C. L\u00f6ding. Methods for the transformation of \u03c9-automata: Complexity and connection to second order logic. Master\u2019s thesis, Christian-Albrechts-University of Kiel, 1998."},{"key":"36_CR7","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0304-3975(84)90049-5","volume":"32","author":"S. Miyano","year":"1984","unstructured":"S. Miyano and T. Hayashi. Alternating finite automata on \u03c9-words. Theoretical Computer Science, 32:321\u2013330, 1984.","journal-title":"Theoretical Computer Science"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems. Springer, 1992.","DOI":"10.1007\/978-1-4612-0931-7"},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(87)90133-2","volume":"54","author":"D.E. Muller","year":"1987","unstructured":"D.E. Muller and P.E. Schupp. Alternating automata on infinite trees. Theoretical Computer Science, 54:267\u2013276, 1987.","journal-title":"Theoretical Computer Science"},{"key":"36_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/3-540-16761-7_77","volume-title":"Proc. 13th IC ALP","author":"D.E. Muller","year":"1986","unstructured":"D.E. Muller, A. Saoudi, and P.E. Schupp. Alternating automata, the weak monadic theory of the tree and its complexity. In Proc. 13th IC ALP, LNCS 226, pages 275\u2013283, 1986."},{"key":"36_CR11","unstructured":"S. Rohde. Alternating automata and the temporal logic of ordinals. PhD thesis, University of Illinois at Urbana-Champaign, 1997."},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"W. Thomas. Languages, automata, and logic. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Language Theory, volume III, pages 385\u2013455. Springer-Verlag, 1997.","DOI":"10.1007\/978-3-642-59126-6_7"},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"W. Thomas. Complementation of B\u00fcchi automata revisited. In J. Karhum\u00e4ki et al., editor, Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa, pages 109\u2013122. Springer, 1999.","DOI":"10.1007\/978-3-642-60207-8_10"},{"key":"36_CR14","doi-asserted-by":"crossref","unstructured":"M.Y. Vardi. Alternating automata: Unifying truth and validity checking for temporal logics. In 14th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence 1249, pages 191\u2013206, 1997.","DOI":"10.1007\/3-540-63104-6_19"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44929-9_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T14:41:00Z","timestamp":1556376060000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44929-9_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678236","9783540449294"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44929-9_36","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}