Automata Theory and Formal Languages

**Semester:** Spring, 2001

**Schedule:** Tuesday 10:40 - 12:30 (T3T4); Thursday 10:40 - 11:30 (R3)

**Office Hours:** Wednesday 15:40 - 17:40 (W8W9)

**Classroom:** EB-162

**Text Book:** John E. Hopcroft and Jeffrey D. Ullman,
*Introduction to Automata Theory, Languages and Computation*,
Addison Wesley Publishing Company, 1979.

**Instructor:**
H. Altay Güvenir
**Teaching Assistant:**
Tolga Aydin (Office
Hours: Thursday 15:40 - 17:40),

**Schedule**

WEEK DAYS TOPICS1 Feb 6, 8 Preliminaries 2 Feb 13, 15 Finite Automata 3 Feb 20, 22 Regular Expressions 4 Feb 27, 1 Regular Expressions 5 Mar 6, 8Holiday6 Mar 13, 15 Properties of Regular Sets 7 Mar 20, 22 Properties of Regular Sets 8 Mar 27, 29 Context-Free Grammars 9 Apr 3, 5 Context-Free Grammars 10 Apr 10, 12 Push Down Automata Apr 16Midterm:17:40-19:30; EB-162, EB-163 11 Apr 17, 19 Properties of Context Free Languages 12 Apr 24, 26 Properties of Context Free Languages 13 May 1, 3 Turing Machines 14 May 8, 10 Turing Machines 15 May 15, 17 UndecidabilityFINAL : 21.05.2001 (Monday); 12:15-14:15; EB-261-262MAKEUP: 21.05.2001 (Monday); 14:30-15:30; EA-502

**Grading Policy:**

Quizzes : 20% Homeworks: 15% Midterm : 30% Final : 35%There will be only one makeup exam, which will be given during the final exam period, after the CS476 final exam. Those who have missed any of the midterm of final exams, due to officially reported health problems, can take this makeup exam.