TDDD14 Formal Languages and Automata Theory

Suggested reading before lectures: more detailed correspondence between the lectures and the textbook and other materials.
List of contents of the course, explains the correspondence between the course and the book.
Errata for our textbooks (D. C. Kozen, Automata and Computability; J. E. Hopcroft, J. D. Ullman, Introduction to Automata...).
Slides used at the lectures.
"Kompendium" used at the tutorials.
Some past exams: January 2013 [pdf], October 2012 [pdf], August 2012 [pdf], January 2012 [pdf], October 2011 [pdf], August 2011 [pdf], January 2011 [pdf], October 2010 [pdf], January 2010 [pdf], August 2009 [pdf], June 2009 [pdf], January 2009 [pdf], January 2006 ([pdf]), May 2005 ([pdf]), May 2003 ([pdf], [ps.gz]), June 2002 ([pdf] [ps.gz]), June 2000, January 2000. Some exams in other file formats available here.
Some example solutions of exam problems.
A summary of differences between the old and current textbook. In some cases this is a difference between our textbook and a commonly accepted approach.
Example applications of (generalized) context-free grammars – definitions of syntax of programming languages. (More precisely, a context-free superset of the language is defined.)
- Ada 95.
- Pascal syntactic diagrams, last three pages of the Revised Report.

Page responsible: Ulf Nilsson
Last updated: 2013-01-31

Department of Computer and Information Science