Lectures

1. Basic notions about relations, functions, formal languages [Part 1 (7 pages)]
2. Finite state automata [Part 2 (18 pages)]
3. Regular expressions [Part 3 (12 pages)]
4. Properties of regular languages [Part 4 (15 pages)]
5. Chomsky grammars and context free languages [Part 5 (25 pages)]

Exercises

1. Functions and relations [Exercise 1]
2. Deterministic and nondeterministic finite automata [Exercise 2]
3. Subset construction [Exercise 3]
4. Finite automata with epsilon-transitions [Exercise 4]
5. Regular expressions and regular languages [Exercise 5]
6. Finite automata vs. regular expressions [Exercise 6]
7. Properties of regular languages, pumping lemma [Exercise 7]
8. Decision problems for regular languages [Exercise 8]
9. Minimization of finite automata [Exercise 9]
10. Normal forms for context-free grammars [Exercise 10]
11. Sample exam [Exercise 11+12]
12. Context-free and context-sensitive grammars [Extra Exercise]