COMP2012/G52LAC Lecture Note Index

Spring 2019

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

31 January 2019

Lecture 2: Deterministic Finite Automata (DFA)

31 January 2019

Lecture 3: Nondeterministic Finite Automata (NFA)

7 February 2019

Lecture 4: Equivalence between NFA and DFA

7 February 2019

Lecture 5: Regular Expressions

14 February 2019

Lecture 6: Equivalence of Regular Expression and Finite Automata

14 February 2019

Lecture 7: Proving Languages Not to Be Regular

21 February 2019

Lecture 8: Introduction to Context-Free Grammars (CFG)

21 February 2019

Lecture 9: The Language of a CFG

28 February 2019

Lecture 10: Derivation Trees and Ambiguity

28 February 2019

Lecture 11: Disambiguating Context-Free Grammars

7 March 2019

Lecture 12: Recursive-Descent Parsing: Introduction

7 March 2019

Lecture 13: Recursive-Descent Parsing: Elimination of Left Recursion

14 March 2019

Lecture 14: Recursive-Descent Parsing: Predictive Parsing

14 March 2019

Lecture 15: Turing Machines

21 March 2019

Lecture 16: λ-Calculus

21 March 2019

Lecture 17: The Church-Turing Thesis

28 March 2019

Lecture 18: Decidability and the Halting Problem

28 March 2019

Lectures 19: Computational Complexity and the P vs. NP Problem

4 April 2019

Last updated 20 March 2019