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

Regular Languages and Finite Automata (50% option only)

Lecturer: Dr A.M. Pitts (ap@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.



next up previous contents
Next: Structured Hardware Design (50% Up: Easter Term 2000: Part Previous: Operating Systems
Christine Northeast
Mon Sep 20 10:28:43 BST 1999