## Free University of Bolzano/Bozen

Faculty of Computer Science - Master of Science in Computer Science

# Theory of Computing

# Lectures Notes A.A. 2005/2006

### Lectures

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

- Finite automata
[Exercise 1]
- Finite automata and regular expressions
[Exercise 2,
notes by Andrea Calì]
- Regular languages
[Exercise 3,
notes by Andrea Calì],

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

course home page

*Last modified:
Wednesday, 25-Jan-2006 0:57:12 CET
*