AUTOMATA AND FORMAL LANGUAGES, Fall 1999 - Syllabus

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

• Teaching assistant:
  Alexander Tsirlin
  Office hours: Mon 10-12 (58) 123
  Tel.: 6477879
  e-mail: tsirlina

• Class hours:
  Section 1: Sun 10-12 (28) 302, Tue 10-12 (28) 302
  Section 2: Sun 16-18 (34) 202, Tue 16-18 (28) 204

• Quiz:
  Section #11: Mon 8-9 (28) 103
  Section #12: Mon 9-10 (28) 103
  Section #13: Mon 18-19 (28) 104
  Section #21: Mon 19-20 (28) 104
  Section #22: Mon 12-13 (34) 205
  Section #23: Mon 13-14 (90) 222

• Midterms: There will be two midterms in the course. The weight of each in the final grade will be 20%.

• Grades: The grades in the first exam will be curved so as to achieve a final average grade of approximately 71. The grades in the second exam will be curved according to the same curving function as the first exam, irrespective of the grades achieved in the second exam. Changes in this procedure may occur in case of unpredicted developments.

• 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.