Abstract
The two determinization procedures of Safra and Muller-Schupp for Büchi automata are compared, based on an implementation in a program called OmegaDet.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
McNaughton, R.: Testing and generating infinite sequences by a finite automaton. Information and Control 9, 521–530 (1966)
Thomas, W.: Automata on Infinite Objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Formal models and semantics, vol. B, pp. 133–191. Elsevier Science Publishers B.V., Amsterdam (1990)
Perrin, D., Pin, J.E.: Infinite Words: Automata, Semigroups, Logic and Games. Pure and Applied Mathematics, vol. 141. Elsevier, Amsterdam (2004)
Michel, M.: Complementation is more difficult with automata on infinite words. CNET, Paris (1988)
Löding, C.: Optimal bounds for the transformation of omega-automata. In: Pandu Rangan, C., Raman, V., Ramanujam, R. (eds.) FST TCS 1999. LNCS, vol. 1738, pp. 97–109. Springer, Heidelberg (1999)
Safra, S.: On the Complexity of ω-Automata. In: Proc. of the 29th Symp. on Foundations of Computer Science, pp. 319–327. IEEE Computer Society Press, Los Alamitos (1988)
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 141, 69–107 (1995)
Miyano, S., Hayashi, T.: Alternating Finite Automata on ω-Words. Theor. Comput. Sci. 32, 321–330 (1984)
Thomas, W.: Languages, Automata and Logic. In: Handbook of Formal Language Theory, vol. III, pp. 389–455. Springer, Heidelberg (1997)
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)
(The Liège Automata-based Symbolic Handler (LASH)), available at http://www.montefiore.ulg.ac.be/~boigelot/research/lash/
Schulte-Althoff, C.: Construction of deterministic ω-automata: A comparative analysis of the algorithms by safra and muller/schupp. Diplomarbeit, RWTH Aachen (2005)
Etessami, K., Wilke, T., Schuller, R.A.: Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 694–707. Springer, Heidelberg (2001)
Kähler, D.: Determinisierung von ω-Automaten. Diplomarbeit, Christian-Albrechts-Universität zu Kiel (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Althoff, C.S., Thomas, W., Wallmeier, N. (2006). Observations on Determinization of Büchi Automata. In: Farré, J., Litovsky, I., Schmitz, S. (eds) Implementation and Application of Automata. CIAA 2005. Lecture Notes in Computer Science, vol 3845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11605157_22
Download citation
DOI: https://doi.org/10.1007/11605157_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31023-5
Online ISBN: 978-3-540-33097-4
eBook Packages: Computer ScienceComputer Science (R0)