Observations on determinization of Büchi automata

Theoretical Computer Science

Volumn 363, Issue 2, 2006, Pages 224-233

  Althoff, Christoph Schulte ^a   Thomas, Wolfgang ^a   Wallmeier, Nico ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Determinization; Muller Schupp; Rabin

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SCIENCE; COMPUTER SOFTWARE; PROBLEM SOLVING;

DETERMINIZATION; MULLER-SCHUPP PROCEDURES; RABIN;

AUTOMATA THEORY;

EID: 33749236468     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.07.026     Document Type: Article

References (15)

1. B. Boigelot, S. Jodogne, P. Wolper, An effective decision procedure for linear arithmetic with integer and real variables, ACM Trans. Comput. Logic 6 (3) (2005) 614-633.
2. K. Etessami, T. Wilke, R.A. Schuller, Fair simulation relations, parity games, and state space reduction for Büchi automata, in: Proc. of ICALP 2001, Lecture Notes in Computer Science, Vol. 2076, Springer, Berlin, 2001, pp. 694-707.
3. D. Kähler, Determinisierung von ω-automaten, Diplomarbeit, Christian-Albrechts-Universität zu Kiel, Juni 2001.
4. J. Klein, C. Baier, Experiments with deterministic ω-automata for formulas of linear temporal logic, in: Proc. 10th Internat. Conf. on the Implementation and Application of Automata, CIAA 2005, Lecture Notes in Computer Science, Vol. 3845, Springer, Berlin, 2005.
5. C. Löding, Optimal bounds for the transformation of omega-automata, in: Proc. 19th Conf. on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 1738, Springer, Berlin, 1999, pp. 97-109.
6. McNaughton R. Testing and generating infinite sequences by a finite automaton. Inform. and Control 9 5 (1966) 521-530
7. Michel M. Complementation is more difficult with automata on infinite words (1988), cNET, Paris
8. Miyano S., and Hayashi T. Alternating finite automata on ω-words. Theoret. Comput. Sci. 32 (1984) 321-330
9. Muller D.E., and Schupp P.E. Simulating alternating tree automata by nondeterministic automata: new results and new proofs of the theorems of Rabin, McNaughton and Safra. Theoret. Comput. Sci. 141 1&2 (1995) 69-107
10. D. Perrin, J.-E. Pin, Infinite Words: Automata, Semigroups, Logic and Games, Pure and Applied Mathematics, Vol. 141, Elsevier, Amsterdam, 2004.
11. S. Safra, On the complexity of ω-automata, in: Proc. 29th Symp. on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1988, pp. 319-327.
12. C. Schulte-Althoff, Construction of deterministic ω-automata: a comparative analysis of the algorithms by safra and muller/schupp, Diplomarbeit, RWTH Aachen, April 2005.
13. The Liège Automata-based Symbolic Handler (LASH), available at 〈http://www.montefiore.ulg.ac.be/~boigelot/research/lash/〉.
14. W. Thomas, Automata on infinite objects, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. B, Formal models and semantics, Elsevier, Amsterdam, 1990, pp. 133-191 (Chapter 4).
15. W. Thomas, Languages, Automata and logic, in: Handbook of Formal Language Theory, Vol. III, Springer, Berlin, 1997, pp. 389-455.