AUTOMATA AND FORMAL LANGUAGES, SUMMER 2004 - Syllabus

• Instructor:
  Daniel Berend
  Tel.: 6461605 (office), 6430588 (home)
  e-mail: berend

• Teaching assistant:
  Shay Zacov
  e-mail: zacovs
  
  

• Class hours:
  Mon 14-16
  Wed 14-16
  

• Homework: The homework grade will be 10% of the final grade (for students passing the final exam).

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