Department of Computer Science College of Engineering University of the Philippines Diliman, Quezon City
COURSE NO. COURSE TITLE COURSE CREDIT SEMESTER INSTRUCTOR EMAIL ADDRESS
: : : : : :
CS 133 Automata Theory and Computability 3 units Second Semester, AY 2012-2013 Nestine Hope S. Hernandez nshernandez@dcs.upd.edu.ph COURSE DESCRIPTION
Finite automata and regular expressions. Context free grammars and pushdown automata. Turing machines, Church’s thesis, complexity classes and undecidability. CLASS SCHEDULE (THU) Tuesdays, 10:00AM - 11:30AM, Classroom 4 Thursdays, 10:00AM - 11:30AM, ERDT Rm COURSE OUTLINE 1. Introduction 2. Regular Languages and Finite Automata 3. Context-Free Languages and Pushdown Automata 4. Turing Machines and the Church-Turing Thesis 5. Decidability and Reducibility
GRADING SYSTEM Requirements: 3 Long exams
1
GENERAL AVERAGE 93 - 100 88 - below 93 85 - below 88 82 - below 85 78 - below 82 74 - below 78 70 - below 74 65 - below 70 60 - below 65 below 60
FINAL GRADE 1.00 1.25 1.50 1.75 2.00 2.25 2.50 2.75 3.00 5.00
CLASS POLICIES EXAMS. Submit bluebooks before the date of examination. No make-up exam will be given unless with a valid excuse. Complaints regarding examination results will be entertained only within a period of one week after the release of the examination papers. Use black or blue pen when taking examinations. Otherwise, no complaints regarding the examination results will be accepted. ATTENDANCE. Students who exceed the maximum allowed absences (6) are advised to drop assuming that the deadline for dropping has not yet lapsed. Otherwise, he/she will be given a grade of 5.0. FINAL EXAM. In the event that the student’s exam average falls below 60%, the student will be obliged to take the final exam. The final grade would then be either 3.0 or 5.0, depending on whether the student passes that exam. CHEATING. Cheating in any form will be subjected to proper disciplinary action and will merit a final grade of 5.0. DURING CLASS HOURS. No smoking. No eating. No sleeping. Turn off your cellular phones or put them in silent mode.
REFERENCES M. Sipser. Introduction to the Theory of Computation: Second Edition. PWS Publishing Company, 2005. J. Hopcroft, R. Motwani, and J. Ullman . Introduction to Automata Theory, Languages and Computation: Second Edition. Addison-Wesley, 2001. Other references that tackle automata and computability theory.
2