1. Games, Logic and Automata Seminar Rotem Zach 1

2. Overview 2

3. Notation 3

4. Recap 4

5. Büchi Acceptance [Büchi 1962] 5

6. Example Which language is recognized? 6

7. Deterministic Büchi Automata 7

8. Muller Acceptance [Muller 1963] 8

9. Example 9

10. 10

11. 11

12. 12

13. 13

14. Rabin Acceptance [Rabin 1969] 14

15. Example 15

16. Streett Acceptance [Streett 1982] 16

17. Example 17

18. 18

19. 19

20. Nondeterministic Equivalence 20

21. Parity Condition [Mostowski 1984] 21

22. Example 22

23. 23

24. 24

25. 25

26. 26

27. 27

28. 28

29. Closure Under Complement 29

30. D’ Muller -> D’ Streett 30

31. 31

32. Deterministic Equivalence 32

33. Lower Bounds [Löding 1999] 33

34. Sources Grädel, Thomas, Wilke (Eds.): Automata, Logics, and Infinite Games: A Guide to Current Research, 2002 J.R. Büchi, On a decision method in restricted second order arithmetic, 1962 D.E. Muller, Infinite sequences and finite machines, 1963 M.O. Rabin, Decidability of second order theories and automata on infinite trees, 1969 R.S. Streett, Propositional dynamic logic of looping and converse is elementary decidable, 1982 A.W. Mostowski. Regular expressions for infnite trees and a standard form of automata, 1984 C. Löding, Optimal bounds for the transformation of omega-automata, 1999 34

35. Questions? 35