G52MAL Lecture Note Index
Spring 2016
This page will contain links to lecture notes for the lectures. Additionally,
all electronic material used during the lectures, in particular slides and any
major pieces of code will be available via this page. The slides are all in
PDF, and there are three versions available for each lecture. The basic
version is intended for on-screen viewing only, whereas the 4 up and 9 up
versions are mainly intended for printing, putting 4 and 9 slides respectively
on each page.
Lecture 1: Administrative Details and Introduction
26 January 2016
Lecture 3: Nondeterministic Finite Automata (NFA)
2 February 2016
Lecture 4: Equivalence between NFA and DFA
4 February 2016
Lecture 5: Regular Expressions
9 February 2016
Lecture 6: Equivalence of Regular Expression and Finite Automata
11 February 2016
Lecture 7: Minimization of Finite Automata
16 February 2016
Lecture 8: Proving Languages Not to Be Regular
18 February 2016
Lecture 9: Introduction to Context-Free Grammars (CFG)
23 February 2016
Lecture 10: The Language of a CFG
25 February 2016
Lecture 11: Derivation Trees and Ambiguity
1 March 2016
Lecture 12: Disambiguating Context-Free Grammars
3 March 2016
Lecture 13: Pushdown Automata (PDA)
8 March 2016
Lecture 14: The Language of a PDA
10 March 2016
Lecture 15: Recursive-Descent Parsing: Introduction
15 March 2016
Lecture 16: Recursive-Descent Parsing: Elimination of Left Recursion
17 March 2016
Lecture 17: Recursive-Descent Parsing: Predictive Parsing
19 April 2016
Lectures 18 & 19: Turing Machines and Decidability
21 & 26 April 2016
Last updated 21 April 2016.