Regular Languages and Finite Automata

Regular Languages and Finite Automata

Andrew Pitts

Six lectures for the Computer Science Tripos, Part IA.

  • Lecture notes and slides. (First edition 1998.)
  • List of corrections to the notes. An error in the definition on Slide 18 caused quite a number of minor changes in pages 18 to 20. If you want a replacement for that whole segment of the notes here it is: replacement for pages 17-22.

  • Feedback from students registered for CST: If high lecturing standards are to be maintained and lower standards to be raised, it is important for lecturers to receive feedback about their lectures. Consequently, we would be grateful if you would complete this questionnaire. A digest of the information will be passed to the Staff-Student Liaison and Teaching Committees.

    To Computer Science Teaching page