{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:04:24Z","timestamp":1725545064859},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310235"},{"type":"electronic","value":"9783540330974"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11605157_22","type":"book-chapter","created":{"date-parts":[[2006,3,1]],"date-time":"2006-03-01T15:07:40Z","timestamp":1141225660000},"page":"262-272","source":"Crossref","is-referenced-by-count":13,"title":["Observations on Determinization of B\u00fcchi Automata"],"prefix":"10.1007","author":[{"given":"Christoph Schulte","family":"Althoff","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Thomas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nico","family":"Wallmeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","volume":"9","author":"R. McNaughton","year":"1966","unstructured":"McNaughton, R.: Testing and generating infinite sequences by a finite automaton. Information and Control\u00a09, 521\u2013530 (1966)","journal-title":"Information and Control"},{"key":"22_CR2","series-title":"Formal models and semantics","first-page":"133","volume-title":"Handbook of Theoretical Computer Science","author":"W. Thomas","year":"1990","unstructured":"Thomas, W.: Automata on Infinite Objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Formal models and semantics, vol.\u00a0B, pp. 133\u2013191. Elsevier Science Publishers B.V., Amsterdam (1990)"},{"key":"22_CR3","series-title":"Pure and Applied Mathematics","volume-title":"Infinite Words: Automata, Semigroups, Logic and Games","author":"D. Perrin","year":"2004","unstructured":"Perrin, D., Pin, J.E.: Infinite Words: Automata, Semigroups, Logic and Games. Pure and Applied Mathematics, vol.\u00a0141. Elsevier, Amsterdam (2004)"},{"key":"22_CR4","volume-title":"Complementation is more difficult with automata on infinite words","author":"M. Michel","year":"1988","unstructured":"Michel, M.: Complementation is more difficult with automata on infinite words. CNET, Paris (1988)"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/3-540-46691-6_8","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"C. L\u00f6ding","year":"1999","unstructured":"L\u00f6ding, C.: Optimal bounds for the transformation of omega-automata. In: Pandu Rangan, C., Raman, V., Ramanujam, R. (eds.) FST TCS 1999. LNCS, vol.\u00a01738, pp. 97\u2013109. Springer, Heidelberg (1999)"},{"key":"22_CR6","first-page":"319","volume-title":"Proc. of the 29th Symp. on Foundations of Computer Science","author":"S. Safra","year":"1988","unstructured":"Safra, S.: On the Complexity of \u03c9-Automata. In: Proc. of the 29th Symp. on Foundations of Computer Science, pp. 319\u2013327. IEEE Computer Society Press, Los Alamitos (1988)"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0304-3975(94)00214-4","volume":"141","author":"D. Muller","year":"1995","unstructured":"Muller, D., Schupp, P.: Simulating Alternating Tree Automata by Nondeterministic Automata: New Results and New Proofs of the Theorems of Rabin, McNaughton and Safra. Theoretical Computer Science\u00a0141, 69\u2013107 (1995)","journal-title":"Theoretical Computer Science"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0304-3975(84)90049-5","volume":"32","author":"S. Miyano","year":"1984","unstructured":"Miyano, S., Hayashi, T.: Alternating Finite Automata on \u03c9-Words. Theor. Comput. Sci.\u00a032, 321\u2013330 (1984)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume-title":"Handbook of Formal Language Theory","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Languages, Automata and Logic. In: Handbook of Formal Language Theory, vol.\u00a0III, pp. 389\u2013455. Springer, Heidelberg (1997)"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Boigelot, B., Jodogne, S., Wolper, P.: An Effective Decision Procedure for Linear Arithmetic with Integer and Real Variables. ACM Transaction on Computational Logic (to appear, 2005)","DOI":"10.1145\/1071596.1071601"},{"key":"22_CR11","unstructured":"(The Li\u00e8ge Automata-based Symbolic Handler (LASH)), available at \n                    \n                      http:\/\/www.montefiore.ulg.ac.be\/~boigelot\/research\/lash\/"},{"key":"22_CR12","unstructured":"Schulte-Althoff, C.: Construction of deterministic \u03c9-automata: A comparative analysis of the algorithms by safra and muller\/schupp. Diplomarbeit, RWTH Aachen (2005)"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1007\/3-540-48224-5_57","volume-title":"Automata, Languages and Programming","author":"K. Etessami","year":"2001","unstructured":"Etessami, K., Wilke, T., Schuller, R.A.: Fair Simulation Relations, Parity Games, and State Space Reduction for B\u00fcchi Automata. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 694\u2013707. Springer, Heidelberg (2001)"},{"key":"22_CR14","unstructured":"K\u00e4hler, D.: Determinisierung von \u03c9-Automaten. Diplomarbeit, Christian-Albrechts-Universit\u00e4t zu Kiel (2001)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11605157_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:05:18Z","timestamp":1619507118000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11605157_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540310235","9783540330974"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11605157_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}