Automaten, Sprachen, Komplexität

 

Lecture in the summer term 2019

 
NFA to DFA Copyright: M. Ritzert
 

Dates

Lecture:
Tue, 12:30 - 14:00 h in AH II

Exercise Class:
Tue, 16:15 - 17:00 h in AH I
Fri, 12:15 - 13:00 h in AH V
 

 
 

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

Lecturer

Christof Löding

 

Exercises

There will be weekly exercise sets. Completing these successfully, reaching at least 50% of the possible points, is necessary for admittance to the examination.

Exam

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

 

External Links