Automaten, Sprachen, Komplexität

 
NFA to DFA Copyright: © M. Ritzert
 
 

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

 

External Links