next up previous contents
Next: Structured Hardware Design (50% Up: Easter Term 2003: Part Previous: Operating Systems I   Contents


Regular Languages and Finite Automata (50% option only)

Lecturer: Prof. A.M. Pitts (amp12@cl.cam.ac.uk)

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 books

Kozen, D.C. (1997). Automata and Computability. Springer-Verlag.
Sudkamp, T.A. (1988). Languages and Machines. Addison-Wesley.
Hopcroft, J.E., Motwani, R. & Ullman, J.D. (2001). Introduction to Automata Theory, Languages, and Computation. Addison-Wesley (2nd ed.).


next up previous contents
Next: Structured Hardware Design (50% Up: Easter Term 2003: Part Previous: Operating Systems I   Contents
Christine Northeast
Wed Sep 4 14:43:05 BST 2002