TR 2:00-3:15pm, 327 Purnell Hall
This course introduces automata and formal language theory. It is a study of the power and the limitations of different classes of computational systems. Although the material is theoretical (there will be no programming), much of the material covered in the course has a direct impact on the development of models and algorithms in compilers, networks, natural language systems, as well as other areas in computer science.
Homeworks:
There will be about 7-8 written homeworks. They will have to be turned in at the beginning of the class on the due date. No late submission will be accepted without prior permission of the instructor.
Exams:
There will be two mid-term exams and a final exam.
Overall Course Grade:
20% Final
40% In-class Midterm exam
40% Homework (all assignments will be weighted equally)
Retain copies of your class notes, handouts, homeworks, and solutions (when provided). Exam questions will generally be similar to homework problems or results presented in class.
In case of questions regarding graded material, first you should contact the TA. Then, if you still have questions, contact the instructor. For other questions, you may contact either the instructor or the TA first.
Cooperative efforts at understanding the material conceptually are encouraged. However, all written work you turn in must be entirely your own. Submitting work that is not your own is considered cheating, as per Departmental and University policy.
MATH 210, CISC181 and CISC220 with grades of C- or better.