### Free University of Bolzano/Bozen

Faculty of Computer Science

Bachelor in Applied Computer Science

# Formal Languages

# Lectures Notes A.Y. 2009/2010

### 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)]

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

course home page

*Last modified:
Tuesday, 2-Feb-2010 10:29:48 CET
*