TDDD85 · 6 credits · Basic level (G1F) · Datateknik, Datavetenskap
Formal Languages and Automata Theory
Discontinued · replaced by TDDE87
43%
passed the latest ordinary exam
TEN1 · 3 Jun 2026 · 56 students
56%
passed the ordinary exams, all sittings over the last 5 years
TEN1 · 278 students
Unusually hard in 2025/26
43% passed the ordinary exam in 2025/26 (56 students), against 59% on average in earlier years (222 students).
Part of 1 programme
Exam
TEN1 Written examination
- 5
- 4
- 3
- U
Ordinary exams
56% passed · 278 students
- 43%56
- 59%56
- 54%50
- 65%62
- 59%54
Re-exams
56% passed · 135 students
- 54%28
- 33%6
- 33%24
- 58%19
- 81%16
- 90%20
- 44%16
- 17%6
- Pass the re-exam: 56% (135 students), compared with 56% (278 students) on the ordinary exam
- Get 4 or 5: 13% (413 students)
Show small sittings (2)
Sittings with fewer than 5 students, often credit transfers or special sittings. They are not part of any figure on this page.
- 0%2
- 0%2
Other modules
Partial exams, hand-ins and labs. They are not part of the figures at the top.
Hand-in or lab
UPG2 Compulsory lab assignments
- G
Main rounds
100% passed · 203 students
- 100%53
- 100%40
- 100%35
- 100%32
- 100%43
Later rounds
100% passed · 42 students
- 100%5
- 100%7
- 100%16
- 100%6
- 100%8
- Pass a later round: 100% (42 students), compared with 100% (203 students) on the ordinary exam
Show small sittings (15)
Sittings with fewer than 5 students, often credit transfers or special sittings. They are not part of any figure on this page.
- 100%2
- 100%1
- 100%1
- 100%1
- 100%1
- 100%4
- 100%1
- 100%4
- 100%2
- 100%1
- 100%4
- 100%1
- 100%1
- 100%1
- 100%2
Hand-in or lab
UPG1 Compulsory lab assignment
- G
No sittings with at least 5 students.
Show small sittings (2)
Sittings with fewer than 5 students, often credit transfers or special sittings. They are not part of any figure on this page.
- 100%1
- 100%1
About the course
Aim
The course will provide an introduction to formal languages and automata theory. Automata and formal languages appear (possibly in different guises) in almost every branch of computer science. After completing the course, the student should be able to:
- Manage different types of language classes and their computation models.
- Apply basic parsing techniques.
- Using methods to show non-membership in formal languages.
Content
Finite automata and regular expressions. Context-free languages and pushdown automata. Deterministic context-free languages, LR parsing. Chomsky's hierarchy. Introduction to Turing machines.
- Examiner
- Victor Lagerkvist
- Scheduled hours
- 50 h
- Main field of study
- Datateknik, Datavetenskap