Observations on determinization of Büchi automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3845 LNCS, Issue , 2006, Pages 262-272

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

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; NUMERICAL METHODS; THEOREM PROVING;

BÜCHI AUTOMATA; DETERMINIZATION PROCEDURES;

AUTOMATA THEORY;

EID: 33745128012     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11605157_22     Document Type: Conference Paper

References (14)

1. McNaughton, R.: Testing and generating infinite sequences by a finite automaton. Information and Control 9 (1966) 521-530
2. Thomas, W.: Automata on Infinite Objects. In van Leeuwen, J., ed.: Handbook of Theoretical Computer Science. Volume B, Formal models and semantics. Elsevier Science Publishers B. V. (1990) 133-191
3. Perrin, D., Pin, J.E.: Infinite Words: Automata, Semigroups, Logic and Games. Volume 141 of Pure and Applied Mathematics. Elsevier (2004)
4. Michel, M.: Complementation is more difficult with automata on infinite words. CNET, Paris (1988)
5. Löding, C.: Optimal bounds for the transformation of omega-automata. In: Proc. of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science. Volume 1738 of Lecture Notes in Computer Science., Springer-Verlag (1999) 97-109
6. Safra, S.: On the Complexity of ω-Automata. In: Proc. of the 29th Symp. on Foundations of Computer Science, Los Alamitos, CA, IEEE Computer Society Press (1988) 319-327
7. 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 (1995) 69-107
8. Miyano, S., Hayashi, T.: Alternating Finite Automata on ω-Words. Theor. Comput. Sci. 32 (1984) 321-330
9. Thomas, W.: Languages, Automata and Logic. In: Handbook of Formal Language Theory. Volume III. Springer-Verlag (1997) 389-455
10. 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)
11. : (The Liège Automata-based Symbolic Handler (LASH)) Available at http://www.montefiore.ulg.ac.be/~boigelot/research/lash/.
12. Schulte-Althoff, C.: Construction of deterministic ω-automata: A comparative analysis of the algorithms by safra and muller/schupp. Diplomarbeit, RWTH Aachen (2005)
13. Etessami, K., Wilke, T., Schuller, R.A.: Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata. In: Proc. of ICALP 2001. Volume 2076 of Lecture Notes in Computer Science., Springer-Verlag (2001) 694-707
14. Kähler, D.: Determinisierung von ω-Automaten. Diplomarbeit, Christian-Albrechts-Universität zu Kiel (2001)