Faculty of Computer Science

Bachelor in Applied Computer Science

- 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 finite automata [Exercise 2]
- Nondeterministic finite automata and 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 and minimization of finite automata. [Exercise 8, home exercise]
- Lab exercises on automata and regular expressions using JFLAP
[Exercise 9+10]
- JFLAP manual (Chapters 1, 2, 4 of [M3])
- JFLAP Examples (for Chapters 1, 2, 4 of [M3])

- Normal forms for context-free grammars [Exercise 11]
- Sample exam:
- Specification [Exercise 12]
- Solution [Exercise 13]

- Context-free and context-sensitive grammars [home exercise]

course home page