Course: Advanced Automata Theory

Summer 2017

• Instructor:

  • Dr. Rupak Majumdar ( rupak@mpi-sws.org ) Room 414, Building 26 (MPI-SWS)

  • Dr. Daniel Neider ( neider@mpi-sws.org ) Room 315, Building 26 (MPI-SWS)

• Tutorials:

  • Dr. Burcu Ozkan ( burcu@mpi-sws.org )

  • Dr. Anne-Kathrin Schmuck ( akschmuck@mpi-sws.org )

• Lectures:

  • Tuesdays 08:15-09:45 48-210 and Wednesdays 13:45-15:15 46-280

• Tutorial: Tuesday 10:00-11:30

• Office hours: By appointment

• Class website: https://wiki.mpi-sws.org/wiki/Courses/AdvancedAutomataTheory

• Mailing list: TBD

Introduction

• Syllabus and contents.

We shall study automata on finite/infinite words and trees and their relationship to logic and computer-aided verification of systems.

• Intended Audience.

Computer science or math students with background in logic and theory of computation. (Familiarity with basic algorithms, logic, and theory of computation will be assumed). Talk to the instructor if you are not sure if you have the background. We shall try to keep the class self-contained, please attend the initial lecture for background material.

Further, I expect you (1) have "mathematical maturity" (e.g., you should be comfortable with proofs and abstract reasoning); (2) are interested in the material; and (3) are willing to spend time outside of class in order to better understand the material presented in lectures.

• Grading

Grading will be based on a written, open-notes, final exam. Open notes means that you are free to bring your notes to the exam. However, you may not use internet access on any device during an exam.

In order to appear for the exam, you have to turn in homework problems (to be assigned approximately biweekly), write up lecture notes for two lectures, and present a result to the class.

• Text book

The following text books cover most of the material (and much more):

1. Michael Sipser, Introduction to the theory of computation, MIT Press

   b. Erich Graedel, Wolfgang Thomas, Thomas Wilke, Automata, Logics, and Infinite Games, Springer

   c. Jeffrey Shallit, A Second Course in Formal Languages and Automata Theory, Cambridge University Press

In addition, we shall provide lecture notes, surveys, or research papers for topics not covered in these books.

• Homework:

Homework exercises will be handed out approximately every two weeks (weekday TBA). Your answers must be handed in until the day specified in the homework, at the beginning of the lecture.

• Teamwork and Academic Honesty:

Students may collaborate on homework assignments, but each student needs to individually write up a solution set and be prepared to present it in class on the due date. The work you submit in this course must be the result of your individual effort. You may discuss homework problems and general proof strategies or algorithms with other students in the course, but you must not collaborate in the detailed development or actual writing of problem sets. This implies that one student should never have in his or her possession a copy of all or part of another student's homework. It is your responsibility to protect your work from unauthorized access. In writing up your homework you are allowed to use any book, paper, or published material. However, you are not allowed to ask others for specific solutions, either in person or by using electronic forums such as newsgroups. Of course, during the administration of exams any form of cooperation or help is forbidden. Academic dishonesty has no place in a university; it wastes our time and yours, and it is unfair to the majority of students. Any dishonest behavior will be severely penalized and may lead to failure in the course.

Announcements

• The first lecture is on April 18, 2017.

Schedule

This schedule is preliminary and subject to change.