Automaten, Sprachen, Komplexität

 

Lecture in the summer term 2022

 
NFA to DFA Copyright: © M. Ritzert
 

Dates

Dates are publicised on RWTHonline and RWTH Moodle.

 
 

Content

This course introduces - via examples obtained from applications - important basic topics of theoretical computer sience. We will analyze automata models, methods of specifying formal languages, and discuss questions regarding computability and complexity.

Prerequisites

There are no requirements for participation in this course.

 

Organization

The course will be held in German.

Time and Places

Dates are publicised on RWTHonline and RWTH Moodle.

Lecturer

Christof Löding

 

Exercises

There will be weekly exercise sets. Completing these successfully, is necessary for admittance to the examination. Details can be found on RWTH Moodle.

Exam

There will be written exams. The exact modalities of the exams will be announced in Moodle.

 

External Links