Theoretical Computer Science is about the mathematical basis and formal computer science methods. Our group is concerned with formal languages as well as with computability and computational complexity theories.  

Formal languages play an important role and provide a basic tool for specifying (computational) problems. From a mathematical point of view, computability theory is concerned with calculation and algorithms. We investigate various models for defining calculation schemes and their potential. Apart from the question of how to solve a problem using algorithms, the question of the efficiency of such an algorithmic solution is also of major importance in computer science. The complexity theory investigates the resource effort required for problem solving.