Advanced Automata Theory

 

Lecture in the summer term 2018

 
Lecture slide vom AAT illustrating the block refinement algorithm Copyright: C. Löding

Contact

Phone

work
+49 241 80 21716

Email

E-Mail
 

Dates

Lecture
Tue, 10:15 - 11:45am (AH II)
Wed, 12:15 - 1:00pm (AH III)

Exercise Class
Fri, 2:15  - 3:45pm (AH II)

 
 

Content

In this lecture of theoretical computer science, we extend concepts and results of the undergraduate course on automata theory. These results can be used for information processing and system construction/analysis.

The following topics are covered in the course:

  • the minimization problem for nondeterministic automata
  • connection of automata and logic
  • automata on finite trees
  • algorithms for infinite transition systems
  • basic undecidability results in automata theory

Prerequisites

Knowledge of automata theory as presented in basic courses is required for participation.

 

Organization

The course will be held in English.

Time and Places

Tuesday, 10:15pm - 11:45am in AH II
Wednesday, 12:15am - 1:00pm in AH III

Lecturer

Christof Löding

 

Exercises

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

The solutions of the exercises will be presented on Friday, 2:15pm - 3:45pm in AH II.

Exam

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

 

External Links