TDDD14 · 6 credits · Basic level (G2F) · Datateknik, Datavetenskap
Formal Languages and Automata Theory
Active · next start HT 2027
60%
passed the latest ordinary exam
TEN1 · 3 Jun 2026 · 10 students
66%
passed the ordinary exams, all sittings over the last 5 years
TEN1 · 38 students
Part of 5 programmes
Exam
TEN1 Written examination
- 5
- 4
- 3
- U
Ordinary exams
66% passed · 38 students
- 60%10
- 78%18
- 50%10
Re-exams
No sittings with at least 5 students.
- Get 4 or 5: 32% (38 students)
Show small sittings (9)
Sittings with fewer than 5 students, often credit transfers or special sittings. They are not part of any figure on this page.
- 100%1
- 50%2
- 75%4
- 0%3
- 100%1
- 100%4
- 25%4
- 25%4
- 50%2
Other modules
Partial exams, hand-ins and labs. They are not part of the figures at the top.
Hand-in or lab
UPG1 Assignments
- G
Main rounds
100% passed · 37 students
- 100%10
- 100%17
- 100%10
Later rounds
No sittings with at least 5 students.
Show small sittings (5)
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%4
- 100%4
- 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
Course content: Finite automata and regular expressions. Context-free grammars and pushdown automata. Deterministic context-free languages, LR parsing. Chomsky's hierarchy. Introduction to Turing Machines and undecidability.
- Examiner
- Victor Lagerkvist
- Scheduled hours
- 50 h
- Main field of study
- Datateknik, Datavetenskap