Beruflich Dokumente
Kultur Dokumente
Texts:
Required: Thomas A. Sudkamp, Languages and Machines: An Introduction to the Theory of Computer Science, 3rd edition,
Pearson, 2005.
Strongly Recommended: Bojana Obrenic, Practice Problems in the Theory of Computation. (Available from the Queens College
Copy Center, 65-01 Kissena Blvd.)
A list of selected reference texts for the course material appears on the opposite side of this syllabus.
Requirements:
Attendance and Participation: Each student is expected to prepare for and attend the lectures. The topic for each lecture and
the associated chapter from the textbook appear below. Active participation will enhance your learning experience and may
also be counted toward your grade.
Lecture Notes: Each student is required to transcribe one of the class lectures as per the schedule to be determined at the
beginning of the semester. Students should submit the notes electronically to the instructor within a week after the assigned
lecture. These notes will be made available to all students in the class via the course Website/Yahoo Group.
Homework: Following most lectures, there will be problems assigned pertaining to that weeks material. Unless stated
otherwise, homework is due at the beginning of the next class meeting.
Exams. There will be three examinations, tentatively schedule for the dates below. Details about the structure of each exam
and the exact sections that it covers will be announced prior to the exam. Many old exams with complete solutions can be
found in our Yahoo group.
Grading:
The course grade is computed from the following work units: Homework and Lecture Notes (20%), Exam 1 (20%), Exam 2
(20%), Final Exam Part I (20%) and Part II (20%).
1. James A. Anderson, Automata Theory with Modern Applications, Cambridge University Press, 2006.
2. J. Glenn Brookshear, Theory of Computation: Formal languages, Automata, and Complexity, Pearson, 1989.
3. Martin Davis, Ron Sigal, and Elaine J. Weyeuker, Computability, Complexity, and Languages: Fundamentals of Theoretical
Computer Science, 2nd edition, Morgan Kaufmann, 1994.
4. Richard Feynman, Feynman Lectures on Computation, Revised edition, Westview Press, 2000.
5. Michael R. Garey and David S. Johnson, A Guide to the Theory of NP-Completeness, W.H. Freeman, 1979.
6. John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman, Introduction to Automata Theory, Languages, and Computation,
3rd edition, Pearson, 2006.
9. Harry Lewis and Christos Papadimitriou, Elements of the Theory of Computation, 2nd edition, Prentice-Hall, 1997.
10. Peter Linz, An Introduction to Formal Languages and Automata, 6th edition, Jones and Bartlett Learning, 2016.
11. Marvin L. Minsky, Computation: Finite and Infinite Machines, Prentice Hall, 1967.
12. Michael Sipser, Introduction to the Theory of Computation, 3rd edition, Cengage Learning, 2013.
13. Thomas A. Sudkamp, Languages and Machines: An Introduction to the Theory of Computer Science, 3rd edition, Pearson,
2005.
14. Adam Brooks Webber, Formal Languages: A Practical Introduction, Franklin, Beedle & Associates, 2008.