Conferences in DBLP

Publications Resulting from Dagstuhl Seminars (dagstuhl)
2001 (conf/dagstuhl/2001automata)

1. Berndt Farwer
   omega-Automata. [Citation Graph (0, 0)][DBLP]
   Automata, Logics, and Infinite Games, 2001, pp:3-20 [Conf]
   
2. René Mazala
   Infinite Games. [Citation Graph (0, 0)][DBLP]
   Automata, Logics, and Infinite Games, 2001, pp:23-42 [Conf]
   
3. Markus Roggenbach
   Determinization of Büchi-Automata. [Citation Graph (0, 0)][DBLP]
   Automata, Logics, and Infinite Games, 2001, pp:43-60 [Conf]
   
4. Felix Klaedtke
   Complementation of Büchi Automata Using Alternation. [Citation Graph (0, 0)][DBLP]
   Automata, Logics, and Infinite Games, 2001, pp:61-78 [Conf]
   
5. Stefan Schwoon
   Determinization and Complementation of Streett Automata. [Citation Graph (0, 0)][DBLP]
   Automata, Logics, and Infinite Games, 2001, pp:79-91 [Conf]
   
6. Ralf Küsters
   Memoryless Determinacy of Parity Games. [Citation Graph (0, 0)][DBLP]
   Automata, Logics, and Infinite Games, 2001, pp:95-106 [Conf]
   
7. Hartmut Klauck
   Algorithms for Parity Games. [Citation Graph (0, 0)][DBLP]
   Automata, Logics, and Infinite Games, 2001, pp:107-129 [Conf]
   
8. Frank Nießner
   Nondeterministic Tree Automata. [Citation Graph (0, 0)][DBLP]
   Automata, Logics, and Infinite Games, 2001, pp:135-152 [Conf]
   
9. Daniel Kirsten
   Alternating Tree Automata and Parity Games. [Citation Graph (0, 0)][DBLP]
   Automata, Logics, and Infinite Games, 2001, pp:153-167 [Conf]
   
10. Júlia Zappe
    Modal µ-Calculus and Alternating Tree Automata. [Citation Graph (0, 0)][DBLP]
    Automata, Logics, and Infinite Games, 2001, pp:171-184 [Conf]
    
11. Luca Alberucci
    Strictness of the Modal µ-Calculus Hierarchy. [Citation Graph (0, 0)][DBLP]
    Automata, Logics, and Infinite Games, 2001, pp:185-201 [Conf]
    
12. Mark Weyer
    Decidability of S1S and S2S. [Citation Graph (0, 0)][DBLP]
    Automata, Logics, and Infinite Games, 2001, pp:207-230 [Conf]
    
13. Klaus Reinhardt
    The Complexity of Translating Logic to Finite Automata. [Citation Graph (0, 0)][DBLP]
    Automata, Logics, and Infinite Games, 2001, pp:231-238 [Conf]
    
14. Philipp Rohde
    Expressive Power of Monadic Second-Order Logic and Modal µ-Calculus. [Citation Graph (0, 0)][DBLP]
    Automata, Logics, and Infinite Games, 2001, pp:239-257 [Conf]
    
15. Martin Leucker
    Prefix-Recognizable Graphs and Monadic Logic. [Citation Graph (0, 0)][DBLP]
    Automata, Logics, and Infinite Games, 2001, pp:263-284 [Conf]
    
16. Dietmar Berwanger, Achim Blumensath
    The Monadic Theory of Tree-like Structures. [Citation Graph (0, 0)][DBLP]
    Automata, Logics, and Infinite Games, 2001, pp:285-302 [Conf]
    
17. Thierry Cachat
    Two-Way Tree Automata Solving Pushdown Games. [Citation Graph (0, 0)][DBLP]
    Automata, Logics, and Infinite Games, 2001, pp:303-317 [Conf]
    
18. Thoralf Räsch
    Introduction to Guarded Logics. [Citation Graph (0, 0)][DBLP]
    Automata, Logics, and Infinite Games, 2001, pp:321-342 [Conf]
    
19. Dietmar Berwanger, Achim Blumensath
    Automata for Guarded Fixed Point Logics. [Citation Graph (0, 0)][DBLP]
    Automata, Logics, and Infinite Games, 2001, pp:343-355 [Conf]
    
20. Carsten Fritz
    Some Fixed Point Basics. [Citation Graph (0, 0)][DBLP]
    Automata, Logics, and Infinite Games, 2001, pp:359-364 [Conf]