Computer Laboratory > Teaching > Course material 2008–09 > Computer Science Tripos Syllabus and Booklist 2008-2009 > Paper 2: Regular Languages and Finite Automata

next up previous contents
Next: Part IB Assessed Exercise Up: Easter Term 2009: Part Previous: Paper 2: Probability   Contents


Paper 2: Regular Languages and Finite Automata

This Paper 2 course is taken by Part IA Computer Science Tripos students only.

Lecturer: Professor A.M. Pitts

No. of lectures: 6

This course is useful for Compiler Construction (Part IB) and Natural Language Processing (Part II).

Aims

The aim of this short course will be to introduce the mathematical formalisms of finite state machines, regular expressions and grammars, and to explain their applications to computer languages.

Lectures

Objectives

At the end of the course students should

Recommended reading

* Hopcroft, J.E., Motwani, R. & Ullman, J.D. (2001). Introduction to automata theory, languages, and computation. Addison-Wesley (2nd ed.).
Kozen, D.C. (1997). Automata and computability. Springer-Verlag.
Sudkamp, T.A. (2005). Languages and machines. Addison-Wesley (3rd ed.).



next up previous contents
Next: Part IB Assessed Exercise Up: Easter Term 2009: Part Previous: Paper 2: Probability   Contents