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

Formal Languages

Lectures Notes A.Y. 2010/2011

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

  1. Functions and relations [Exercise 1]
  2. Deterministic finite automata [Exercise 2]
  3. Nondeterministic finite automata and subset construction [Exercise 3]
  4. Finite automata with epsilon-transitions [Exercise 4]
  5. Regular expressions and regular languages [Exercise 5]
  6. Finite automata vs. regular expressions [Exercise 6]
  7. Properties of regular languages, pumping lemma [Exercise 7]
  8. Decision problems for regular languages and minimization of finite automata. [Exercise 8, home exercise]
  9. Lab exercises on automata and regular expressions using JFLAP [Exercise 9+10]
  10. Normal forms for context-free grammars [Exercise 11]
  11. Sample exam:
  12. Context-free and context-sensitive grammars [home exercise]

Back to course home page
Last modified: Friday, 21-Jan-2011 11:25:21 CET