
Schedule
Fall 2017
Lectures
(4032FUIN6H):
11:0012:45, room Snellius B01
Practica (4032FUIN6W): 13:3015:15 room Snellius B01 
Goal
The course gives an introduction is an introduction to the theory of computation with emphasis on the relationships between formal languages, automata and abstract models of computation.
Description
Automata theory and formal languages form the foundations of theoretical computer science, as they allow us to talk precisely about what is an algorithm or a computation.
An automaton is in fact a model of computation that can be defined mathematically. The simplest model that we will consider in this course is given by finite state automaton: a machine that is only able to keep track of its current state but it has no memory. Finite state automata specify an algorithmic procedure for recognizing whether a word is in a language. We will concentrate on the relationships between language recognized by a finite state automaton, language generated by a grammar and language described by a specification, and will obtain algorithms for translating one description of a language into another description of a different type.
Adding restricted form of memory to finite state automata increase their expressivity. We will study pushdown automata, i.e. the class of automata with an auxiliary memory organized as a stack. In particular we will concentrate on the class of languages recognized by pushdown automata, because of its major role in compiler design and parsing.
Literature
Schedule Lectures
Nun  Date  Topic  Reading  Exercises* 
1a  5 Sep  Overview and motivation  

1b  
Languages  [Mar10]:1.4  1.33, 1.36, 1.37 
1c  Deterministic Finite Automata (DFA)  [Mar10]:2.1  2.1, 2.2, 2.5  
1d  Automata constructions  [Mar10]:2.2  2.10, 2.11, 2.12  
2a  19 Sep 
Distinguishability  [Mar10]:2.3  2.13, 2.14, 2.21 
2b 
Pumping lemma for Regular Languages  [Mar10]:2.4  2.22  
Homework 1  Solution  Deadline:26 September 
*=Solutions of most of the exercises treated in the practicum can be found either at the end of the book [Mar10] (in bold) or here.
Bibliography
[BBCF10] Jean Berstel, Luc Boasson, Olivier Carton, and Isabelle Fagnot, Minimization of automata, arXiv:1010.5318v3 [cs.FL] 30 Dec 2010.[CZ02] J.M. Champarnaud and D. Ziadi, Canonical Derivatives, Partial Derivatives and Finite Automaton Constructions. Theoretical Computer Science 289(1):137163, Elsevier Science , 2002.
[Mar10] John C. Martin, Introduction to Languages and the Theory of Computation, 4th Revised edition, McGraw Hill Higher Education, 2010.
Exam and
Homework information
 Examination is worth 70% of the final grade (with a minimum of 5.5). The remaining 30% is from the average grade of the 4 best out of the 5 homeworks.
 Write clearly your name and student number in your homework solution.
 Return your homework solution as a single pdf file by email to Larissa Wolters.
 Name your pdf file containing the solution as HWxxNameSurname.pdf, where xx ranges from 1 to 5 and it is the number of homework.
 Solutions
sent after the deadlines are not accepted.
 Grades of the homeworks will be
published on blackboard.
Past Examinations
 January 2015 (solutions) and March 2015 (solutions)
 January 2016 (solutions) and March 2016 (solutions)
 January 2017 (solutions) and March 2017 (solutions)