inf401 - Foundations of Theoretical Computer Science

At the end of the lecture period

Written or oral exam

Introduction to the theory of automata, formal languages, computability, and complexity
Professional competence
The students:

• know different classes of languages (e.g. regular and context-free languages)
• know automata models corresponding to the respective language classes (e.g. finite automata, pushdown automata, Turing machines)
• construct automata, Turing machines, and grammars for given tasks
• know equivalent formalisations of the concept of algorithm
• classify functions as algorithmically computable and problems as algorithmically decidable
• know and recognize undecidable problems
• evaluate the complexity of algorithms
• know problems that are solvable deterministically or nondeterministically in polynomial time
• know the relevance of NP-complete problem 

Methodological competence
The students:

• learn about the power of abstract models of computation
• know problems which are not efficiently solvable and can detect these in practical tasks

Social competence
The students:

• work together in small groups to solve problems
• present solutions to problems to groups of other students

Self-competence
The students:

• learn persistence in pursuing difficult tasks
• learn precision in writing down solutions