## Free University of Bolzano/Bozen

Faculty of Computer Science - Master of Science in Computer Science

# Theory of Computing

# Lectures Notes A.A. 2004/2005

### Lectures

- Basic notions about formal languages
[Part 1 (2 pages)]
- Finite automata
[Part 2 (18 pages)]
- Regular expressions
[Part 3 (10 pages)]
- Properties of regular languages
[Part 4 (15 pages)]
- Chomsky grammars and context free languages
[Part 5 (16 pages)]
- Pushdown automata
[Part 6 (9 pages)]
- Properties of context-free languages
[Part 7a
Part 7b (27 pages)]
- Introduction to Turing Machines
[Part 8 (25 pages)]
- Decidability and undecidability
[Part 9 (15 pages)]
- Computational complexity
[Part 10 (18 pages)]

- Finite automata
[Exercise 1]
- Finite automata and regular expressions
[Exercise 2,
by Andrea Calì]
- Regular languages
[Exercise 3,
by Andrea Calì]
- Pumping lemma for regular languages, decision problems for regular
languages
[Exercise 4,
by Andrea Calì]
- Minimization of finite automata, formal grammars
[Exercise 5,
by Andrea Calì]
- Minimization of finite automata, formal grammars
[Exercise 6,
by Andrea Calì]
- Exercises for the midterm exam
[Exercise 7]
- Exercises on context-free grammars and pushdown automata
[Exercise 8,
by Andrea Calì]
- Exercises on closure properties of context-free languages and Turing
Machines
[Exercise 9,
by Andrea Calì]
- Exercises on nondeterministic Turing Machines and extensions of Turing
Machines
[Exercise 10
by Andrea Calì]
- Exercises on recursive and recursively enumerable languages
[Exercise 11]
- Exercises on computational complexity
[Exercise 12]

course home page

*Last modified:
Friday, 11-Mar-2005 16:54:45 CET
*