3515ICT Lecture notes
Preliminaries
Sample proofs slides
Regular languages
Kleene's Theorem slides
Minimisation of DFAs slides
Context-free languages
(slightly out-of-date)
Context-free languages slides
Computability
(badly out-of-date)
Turing machines slides
Decidability slides
Undecidability slides
Computational complexity
Slides
Summary
Last modified: $Date: 2008/01/25 02:25:26 $, by Rodney Topor