Free University of Bolzano/Bozen
Faculty of Computer Science
Bachelor in Applied Computer Science

Formal Languages

Lectures Notes A.Y. 2008/2009

Prof. Diego Calvanese


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 [notes by Kurt Ranalter]

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

Back to course home page
Last modified: Friday, 16-Jan-2009 13:05:00 CET