### Free University of Bolzano/Bozen

Faculty of Computer Science

Bachelor in Applied Computer Science

# Formal Languages

# Lectures Notes A.Y. 2008/2009

### Lectures

- Basic notions about relations, functions, formal languages
[Part 1 (7 pages)]
- Finite state 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 (25 pages)]

### Exercises [notes by Kurt Ranalter]

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

course home page

*Last modified:
Friday, 16-Jan-2009 13:05:00 CET
*