{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T20:17:21Z","timestamp":1784837841713,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540668367","type":"print"},{"value":"9783540466918","type":"electronic"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46691-6_8","type":"book-chapter","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T20:42:24Z","timestamp":1186692144000},"page":"97-109","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":43,"title":["Optimal Bounds for Transformations of \u03c9-Automata"],"prefix":"10.1007","author":[{"given":"Christof","family":"L\u00f6ding","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2000,6,9]]},"reference":[{"key":"8_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. 97, 99"},{"key":"8_CR2","unstructured":"J.R. B\u00fcchi. Winning state-strategies for boolean-F \u03c3 games. manuscript, 1981. 97, 98, 103"},{"issue":"4","key":"8_CR3","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.2307\/2273681","volume":"48","author":"J.R. B\u00fcchi","year":"1983","unstructured":"J.R. B\u00fcchi. State-strategies for games in F \u03c3\u03b4 \u2229 G \u03b4\u03c3. Journal of Symbolic Logic, 48(4):1171\u20131198, December 1983. 97, 98, 103","journal-title":"Journal of Symbolic Logic"},{"key":"8_CR4","unstructured":"S. Dziembowski, M. Jurdzi\u0144ski, and I. Walukiewicz. How much memory is needed to win infinite games? In Proc. IEEE, LICS, 1997. 97, 98, 104, 104, 104"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Y. Gurevich and L. Harrington. Trees, automata and games. In Proc. 14th ACM Symp. on the Theory of Computing, pages 60\u201365, 1982. 97, 98, 103","DOI":"10.1145\/800070.802177"},{"key":"8_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/3-540-59042-0_69","volume-title":"12th Annual Symposium on Theoretical Aspects of Computer Science","author":"S. Krishnan","year":"1995","unstructured":"S. Krishnan, A. Puri, and R. Brayton. Structural complexity of \u03c9-automata. In 12th Annual Symposium on Theoretical Aspects of Computer Science, volume 900 of Lecture Notes in Computer Science, pages 143\u2013156. Springer, 1995. 106, 106"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/BF01691063","volume":"3","author":"L.H. Landweber","year":"1969","unstructured":"L.H. Landweber. Decision problems for \u03c9-automata. Math. System Theory, 3:376\u2013384, 1969. 103","journal-title":"Math. System Theory"},{"key":"8_CR8","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. 98"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","volume":"9","author":"R. McNaughton","year":"1966","unstructured":"R. McNaughton. Testing and generating infinite sequences by a finite automaton. Information and Control, 9:521\u2013530, 1966. 97","journal-title":"Information and Control"},{"key":"8_CR10","volume-title":"Complementation is much more difficult with automata on infinite words","author":"M. Michel","year":"1988","unstructured":"M. Michel. Complementation is much more difficult with automata on infinite words. Manuscript,CNET, Paris, 1988. 97, 97"},{"key":"8_CR11","series-title":"Lect Notes Comput Sci","first-page":"157","volume-title":"Regular expressions for infinite trees and a standard form of automata","author":"A.W. Mostowski","year":"1984","unstructured":"A.W. Mostowski. Regular expressions for infinite trees and a standard form of automata. Lecture Notes in Computer Science, 208:157\u2013168, 1984. 97, 99"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"D.E. Muller. Infinite sequences and finite machines. In Proc. 4th IEEE Symposium on Switching Circuit Theory and Logical design, pages 3\u201316, 1963. 97, 99","DOI":"10.1109\/SWCT.1963.8"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/1995086","volume":"141","author":"M.O. Rabin","year":"1969","unstructured":"M.O. Rabin. Decidability of second order theories and automata on infinite trees. Transaction of the AMS, 141:1\u201335, 1969. 97, 99","journal-title":"Transaction of the AMS"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"S. Safra. On the complexity of \u03c9-automata. In Proc. 29th IEEE Symp. on Foundations of Computer Science, pages 319\u2013327, 1988. 97, 97, 100","DOI":"10.1109\/SFCS.1988.21948"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"S. Safra. Exponential determinization for \u03c9-automata with strong-fairness acceptance condition. In Proc. 24th ACM Symp. on the Theory of Computing, pages 275\u2013282, 1992. 103","DOI":"10.1145\/129712.129739"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"S. Safra and M. Y. Vardi. On \u03c9-automata and temporal logic. In Proc. 21th ACM Symp. on the Theory of Computing, 1989. 103","DOI":"10.1145\/73007.73019"},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0019-9958(82)91258-X","volume":"54","author":"R.S. Streett","year":"1982","unstructured":"R.S. Streett. Propositional dynamic logic of looping and converse is elementary decidable. Information and Control, 54:121\u2013141, 1982. 97, 99","journal-title":"Information and Control"},{"key":"8_CR18","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. 98, 101, 102, 102, 103"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46691-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T07:01:15Z","timestamp":1737356475000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46691-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540668367","9783540466918"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-46691-6_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"9 June 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}