next up previous contents
Next: Numerical Analysis I Up: Michaelmas Term 2003: Part Previous: Learning Day   Contents


Mathematics for Computation Theory

Lecturer: Dr J.K.M. Moody

No. of lectures and practical classes: 12 + 5

This course is a prerequisite for Introduction to Security, Computation Theory, Artificial Intelligence I.


Aims


The aims of this course are to introduce the basic notation and constructs of set theory. The course will cover functions and relations, and will treat sufficient of the theory of partial orders to handle well-founded induction. The ideas are illustrated by developing the theory of finite automata and regular languages, including a proof of Kleene's Theorem.


Lectures


Part A. Discrete Mathematics

Part B. Finite Automata and Regular Languages

Objectives


At the end of the course students should

Recommended books


Stanat, D.F. & McAllister, D.F. (1977). Discrete mathematics in computer science. Prentice-Hall.
Stone, H.S. (1973). Discrete mathematical structures and their applications. SRA.
Hopcroft, J.E. & Ullman, J.D. (1979). Introduction to automata theory, languages and computation. Addison-Wesley.
Hopcroft, J.E. & Ullman, J.D. (1974). The design and analysis of computer algorithms. Addison-Wesley.
Conway, J.H. (1971). Regular algebra and finite machines. Chapman and Hall.
Sudkamp, T.A. (1988). Languages and machines. Addison-Wesley.



next up previous contents
Next: Numerical Analysis I Up: Michaelmas Term 2003: Part Previous: Learning Day   Contents
Christine Northeast
Thu Sep 4 15:29:01 BST 2003