AUTOMATA AND FORMAL LANGUAGES, Fall 1998 - Syllabus

• Instructor:
  Daniel Berend
  Office hours: Sun 14-16 (313)
  Tel.: 6461605 (office), 6430588 (home)
  e-mail: berend

• Teaching assistant:
  Michael Segal
  Office hours: Mon 12-14 (303)
  Tel.: 6461623
  e-mail: segal

• Class hours:
  Section 1: Sun 10-12 (28) 302, Tue 10-12 (32) 307
  Section 2: Sun 16-18 (28) 302, Tue 16-18 (28) 303

• Quiz:
  Section #11: Mon 15-16 (34) 209
  Section #12: Mon 16-17 (34) 202
  Section #13: Mon 12-13 (72) 238
  Section #21: Mon 18-19 (34) 305
  Section #22: Mon 19-20 (34) 305
  Section #23: Mon 20-21 (34) 305

• Course account: auto991
  (Please do not send any messages to this account.)

• Homework: Some of the assignments will be theoretical and some will require computer work. Handing all of them is obligatory. Theoretical assignments are to be given by each student separately. Computer work may be submitted by pairs.

• Grades: The grades in the first exam will be curved so as to achieve an approximate pre-determined average, which will be announced at the beginning of the semester. 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 first exam. Changes in this procedure may occur in case of unpredicted developments. The homework grade will be counted as part of the final grade (for students passing the 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.
  2. T.A. Sudkamp, Languages and Machines.
  3. H.R. Lewis and C.H. Papadimitriou, Elements of the Theory of Computation.
  4. J. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages and Computation.
  5. D. Wood, Theory of Computation.