{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:33:50Z","timestamp":1725482030171},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540646945"},{"type":"electronic","value":"9783540691044"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0031395","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T02:38:17Z","timestamp":1134268697000},"page":"228-231","source":"Crossref","is-referenced-by-count":1,"title":["The automata theory package omega"],"prefix":"10.1007","author":[{"given":"J.","family":"V\u00f6ge","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Ulbrand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"O.","family":"Matz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Buhrke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,29]]},"reference":[{"key":"20_CR1","unstructured":"M. Ackermann, W. Thomas, S. Ulbrand, and J. V\u00f6ge, Report on the Program omega, to appear, 1997."},{"key":"20_CR2","unstructured":"N. Buhrke, H. Lescow, and J. V\u00f6ge, Strategy construction in infinite games with streett and robin chain winning conditions, TACAS'96 (T. Magaria and B. SteRen, eds.), Lect. Notes Comput. Sci., vol. 1055, Springer-Verlag, 1996, pp. 207\u2013225."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"E. M. Clarke, I. A. Browne, and R. P. Kurshan, A unified approach for showing language containment and equivalence between various types of \u03c9 automata, CAAP'90 (A. Arnold, ed.), LNCS, vol. 431, Springer-Verlag, 1990, pp. 103\u2013116.","DOI":"10.1007\/3-540-52590-4_43"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"E. A. Emerson and C. L. Lei, Temporal reasoning under generalized fairness constraints, 3rd Annual Symp. on Theoretical Aspects of Computer Science (Berlin) (B. Monien and G. Vidai-Naquet, eds.), LNCS, vol. 208, Springer-Verlag, 1986, pp. 21\u201336.","DOI":"10.1007\/3-540-16078-7_62"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"E. A. Emerson, Automata, tableaux, and temporal logics, Logics of Programs (Berlin, Heidelberg, New York) (R. Parikh, ed.), LNCS, vol. 193, Springer-Verlag, 1985, pp. 79\u201388.","DOI":"10.1007\/3-540-15648-8_7"},{"key":"20_CR6","unstructured":"H. Lescow and J. V\u00f6ge, Minimal separating sets for mutter automata, this volume."},{"key":"20_CR7","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0168-0072(93)90036-D","volume":"65","author":"R. McNaughton","year":"1993","unstructured":"R. McNaughton, Infinite games played on finite graphs, Ann. Pure Appl. Logic 65 (1993), 149\u2013184.","journal-title":"Ann. Pure Appl. Logic"},{"key":"20_CR8","unstructured":"O. Matz, A. Miller, A. Potthoff, W. Thomas, and E. Valkema, Report on the Program AMoRE, Tech. Report 9507, Inst. f. Informatik u. Prakt. Math., CAU Kiel, 1995."},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"S. Safra, On the complexity of w-automata, Proc. 29th IEEE Symp. on Foundations of Computer Science, 1988 pp. 319\u2013327.","DOI":"10.1109\/SFCS.1988.21948"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"W. Thomas, Automata on infinite objects, Handbook of Theoretical Computer Science (Amsterdam) (Jan van Leeuwen, ed.), vol. B, Elsevier, Amsterdam, 1990, pp. 135\u2013191.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"W. Thomas, On the synthesis of strategies in infinite games, STACS 95, LNCS, vol. 900, Springer-Verlag, 1995, pp. 1\u201313.","DOI":"10.1007\/3-540-59042-0_57"},{"key":"20_CR12","volume-title":"Handbook of Formal Language Theory (New York)","author":"W. Thomas","year":"1996","unstructured":"W. Thomas, Languages, automata, and logic, Handbook of Formal Language Theory (New York) (G. Rozenberg and A. Salomaa, eds.), vol. III, Springer-Verlag, New York, 1996, (to appear)."},{"issue":"9","key":"20_CR13","first-page":"473","volume":"13","author":"K. Wagner","year":"1977","unstructured":"K. Wagner, Eine topologische Charakterisierung einiger Klassen regul\u00e4rer Folgenmengen, Elektronische Informationsverarbeitung und Kybernetik 13 (1977), no. 9, 473\u2013487.","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Th. Wilke and H. Yoo, Computing the Wadge degree, the Lifshitz degree, and the Rabin index of a regular language of infinite words in polynomial time, Trees in Algebra and Programming-CAAP '95 (P.D. Moses et al., ed.), LNCS, vol. 915, Springer-Verlag, 1995, pp. 288\u2013302.","DOI":"10.1007\/3-540-59293-8_202"}],"container-title":["Lecture Notes in Computer Science","Automata Implementation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0031395","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T09:51:59Z","timestamp":1586598719000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0031395"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540646945","9783540691044"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0031395","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}