TDDE87 · 5 credits · Basic level (G1F) · Datavetenskap
Formal Languages and Automata Theory
Active · next start HT 2027
No exam statistics yet
There is no exam sitting with at least 5 students in the last three academic years. New courses and project-only courses often have no statistics.
Part of 1 programme
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
- Datavetenskap