AUTOMATA AND FORMAL LANGUAGES, Fall 2002 - Syllabus

• Instructor:
  Daniel Berend
  Office hours: Wed 12-14 (58) 203
  Tel.: 6461605 (office), 6430588 (home)
  e-mail: berend

• Teaching assistants:
  
  Barak Naveh
  Office hours: Wed 17-19 (58) -123
  Tel.: 6477828
  e-mail: barnav
  
  Eran Omri
  Office hours: Mon 12-14 (58) 121
  Tel.: 6477878
  e-mail: omrier
  
  Tamar Pinhas
  Office hours: Wed 14-16 (58) 123
  Tel.: 6477879 (office)
  e-mail: matuskat

• Class hours:
  Section 1: Sun 10-12 (28) 202, Wed 10-12 (34) 202
  Section 2: Sun 18-20 (32) 208, Thu 9-11 (90) 127
  Section 3: Sun 16-18 (28) 302, Thu 12-14 (90) 326

• Quiz:
  Section #11: Thu 9-11 (90) 244
  Section #12: Thu 11-12 (32) 112
  Section #13: Wed 16-17 (90) 236
  Section #21: Tue 16-17 (28) 102
  Section #22: Wed 12-13 (90) 244
  Section #23: Wed 17-18 (32) 110
  Section #31: Wed 9-10 (32) 207
  Section #32: Mon 17-18
  Section #33: Mon 18-19 (32) 209

• Midterms: There will be two midterms in the course. The weight of each will be 20% if it is higher than the grade on the final exam and 15% otherwise.

• Homework: The homework grade will be counted as part of the final grade (for students passing the combination of midterms and final exam). The weight of the homework will be pretty significant; its exact value will be decided by the teacher and students together, towards the end of the semester.

• Bibliography:
  1. J. Martin, Introduction to Languages and the Theory of Computation, 2nd ed., McGraw-Hill.
  2. T.A. Sudkamp, Languages and Machines, 2nd ed., Addison-Wesley.
  3. H.R. Lewis and C.H. Papadimitriou, Elements of the Theory of Computation, Prentice-Hall.
  4. J. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley.
  5. D. Wood, Theory of Computation, Wiley.
  6. D.I.A. Cohen, Introduction to Computer Theory, 2nd ed., Wiley.