Logo

COM2003 - Automata, Logic and Computation (First Semester)

Lectures

Problems Sheets

Throughout the course you should be tackling problems and exercises from Sipser, to develop your understanding of concepts covered in the lectures and the associated reading from the book. While these cannot be formally marked, you are encouraged to bring full or partial solutions to the office hour for feedback, especially if you are uncertain about whether your solutions are correct. In addition, two formative assessments will be set. These are not credit bearing, but are an opportunity for you to receive detailed feedback on your understanding of the core concepts and techniques that will be required for the exam.

Exam Guide

Assessment for semester 1 will be entirely by examination in January.

Office Hour

James' main office is not in Regent Court. Hence he will hold an office hour on Fridays in his departmental office (152), from 12:00 to 13:00. Please contact James in person about the course either after one of the lectures, or during this office hour. Please do not use email except in case of urgency - you are likely to be told to come to an office hour.

Staff Absences

Due to research commitments, lectures and office hours will not be held on the following dates:

Learning Aids

You may find it useful to use a simulation environment to develop and veryify your understanding of automata and computation, such as JFLAP from Duke University. Note that this software will not be directly used or supported during the course, but is suggested for self-study. Also note that you must learn the procedures for manipulating automata covered during the course, rather than simply rely on JFLAP to do them for you; you will not be able to use JFLAP during the exam!

Core Text

The lectures and study material closely follow the contents of M. Sipser, Introduction to the Theory of Computation (2nd edition), available from the library and from Blackwell's. You are expected to read the pages indicated for each lecture.

Just for Fun


James A. R. Marshall. Last modified on December 17th 2014