AUTOMATA THEORY

PURE MATHEMATICS C
AUTUMN 2009

2009 Exam paper and solutions

General information

Lecturer Dr Mark V Lawson
Times of lectures Monday 13.15/14.15, Tuesday 15.15/16.15, Friday 9.15/10.15.
Venue CM G01.
Tutorials Friday 10.15/11.15.
Office CMS21
Homeworks There will be 6 homeworks based on past exam papers.
Exams The exam will take place on Tuesday 15th December 2009 at 9.30 am in Sports Hall 1.

What this module is about

This term, the course will consist of an introduction to the theory of finite automata. The prerequisites for this course are:

A knowledge of basic set theory.
A knowledge of basic proof techniques, especially induction.

Finite automata were originally introduced as models of very simple computers. However, over the past decade or so mathematicians have found them useful in a variety of different fields. Unfortunately, I won't have time to say much about these applications. Instead, I shall concentrate on setting out the basic theory.

Module handouts (also on VISION)

Module information sheet. This will be handed out during the first lecture.

Lecture notes. This also contains the 2008 exam paper and solutions, and the solutions to all exercises. Please note: you should not attempt the exercises with the solutions in front of you, but only refer to them after you have made an honest attempt.

7.IX.09