All electronic material used during lectures will appear here. In particular, lecture slides and any major pieces of code will be available via this page.

- Lecture Notes
- Lecture 1: Administrative Details and Introduction
- Lecture 2: Alphabets, Words and Languages
- Lecture 3: Deterministic Finite Automata (DFAs)
- Lecture 4: Nondeterministic Finite Automata (NFAs)}
- Lecture 5: Equivalence between NFAs and DFAs
- Lecture 8 (Henrik Nilsson): Equivalence of regular expressions and finite automata
- Lecture 9: Proving Languages not to be Regular

*Last updated 3rd October 2011.*