{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T05:40:01Z","timestamp":1737610801421,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540418641"},{"type":"electronic","value":"9783540453154"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45315-6_6","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T06:28:39Z","timestamp":1196663319000},"page":"88-103","source":"Crossref","is-referenced-by-count":1,"title":["The Finite Graph Problem for Two-Way Alternating Automata"],"prefix":"10.1007","author":[{"given":"Mikolaj","family":"Boja\u0144czyk","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,3,23]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/A:1004275029985","volume":"27","author":"H. Andreka","year":"1998","unstructured":"H. Andreka, J. van Benthem and I. Nemeti, Modal Languages and Bounded Fragments of Predicate Logic, Journal of Philosophical Logic, 27 (1998), pp. 217\u2013274.","journal-title":"Journal of Philosophical Logic"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"E. A. Emerson and C. Jutla: Tree Automata, Mu-Calculus and Determinacy, in Proc. 32th IEEE Symposium on Foundations of Computer Science pages 368\u2013377.","DOI":"10.1109\/SFCS.1991.185392"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"R. S. Street and E. A. Emerson: An Automata theoretic procedure for the propositional mu-calculus. Information and Computation, 81:249\u2013264.","DOI":"10.1016\/0890-5401(89)90031-X"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"E. Gradel and I. Walukiewicz: Guarded Fixed Point Logic, Proc. 14th IEEE Symp. on Logic in Computer Science, pages 45\u201354.","DOI":"10.1109\/LICS.1999.782585"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"D. Kozen: Results on the Propositional \u00b5-calculus, in Theoretical Computer Science, Vol. 27 pages 333\u2013354.","DOI":"10.1016\/0304-3975(82)90125-6"},{"key":"6_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/3-540-15648-8_16","volume-title":"Logics of Programs","author":"O. Lichtenstein","year":"1985","unstructured":"O. Lichtenstein, A. Pnueli and L. Zuck: The Glory of the Past, in Logics of Programs, Vol. 193 LNCS pages 196\u2013218."},{"key":"6_CR7","unstructured":"A. W. Mostowski: Games with Forbidden Positions, Technical Report 78, University of Gda\u00f1sk, 1991."},{"key":"6_CR8","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":"6_CR9","doi-asserted-by":"crossref","unstructured":"D. Niwi\u00f1ski: Fixed Points vs. Infinite Generation, in Proc. 3rd IEEE LICS pages 402\u2013409.","DOI":"10.1109\/LICS.1988.5137"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"R. S. Streett:Propositional dynamic logic of looping and converse, in Information and Control, Vol. 54, pages 121\u2013141.","DOI":"10.1016\/S0019-9958(82)91258-X"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Wolfgang Thomas: Languages, Automata, and Logic, in Handbook of Formal Language Theory, III, Springer, pages 389\u2013455.","DOI":"10.1007\/978-3-642-59126-6_7"},{"key":"6_CR12","unstructured":"M. Vardi: Why is modal logic so robustly decidable?, in Descriptive Complexity and Finite Models, AMS, pages 149\u2013184."},{"key":"6_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1007\/BFb0055090","volume-title":"Reasoning About the Past with Two-way Automata","author":"M. Vardi","year":"1998","unstructured":"M. Vardi: Reasoning About the Past with Two-way Automata, in Vol. 1443 LNCS pages 628\u2013641."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45315-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T04:57:29Z","timestamp":1737608249000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45315-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540418641","9783540453154"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45315-6_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}