CSC2428 LOGIC AND
AUTOMATA WINTER 2005
We meet in BA1220, 3-5pm on Thursdays
Instructor: L. Libkin
Requirements: class attendance, taking notes, 2 sets of problems,
short presentation
Suggested reading:
- Infinite Words: Automata,
Semigroups, Logic and Games, by D. Perrin and J.-E.Pin,
chapter "Automata
and infinite words"
- W. Thomas. Languages,
automata and logic. Chapter in the Handbook of Formal Languages.
Linked here is a technical
report whose contents are very close to the chapter.
- I. Walukiewicz. Automata
and Logic. (these notes concentrate on the mu-calculus).
- L. Libkin. Elements of Finite Model Theory,
especially chapter 7.
- M. Vardi's course notes on automata in
verification.
- E. Grädel, W. Thomas, and Th. Wilke. Automata,
logics, and
infinite games, volume 2500 of Lecture Notes in Computer
Science. Springer, 2002.
- The TATA book: Tree Automata Techniques
and Applications
- M.Vardi's
Banff
notes on LTL and automata.
Continuously assigned homework
LECTURES:
Lecture 1 (13
January) .tex
template for scribes
Lecture 2 (20 January)
Lecture 3 (27 January)
Lecture 4 (3 February)
Lecture 5 (10 February)
Lecture 6 (24 February)
Lecture 7 (3 March)
Lecture 8 (10 March)
Lecture 9 (17 March)
Lecture 10 (24 March)
Lecture 11 (31 March)