|
|
 |
15-453 Formal Languages, Automata and Computation
Fall 2005, TTH 12:00-1:20, HBH 1002
|
[Schedule/Assignments |
Project Handout |
What's New]
Instructors:
Lenore Blum, Wean Hall 4105. Office Hours:
By
appointment
Manuel Blum, Wean Hall 4113. Office Hours:
TTh 1:30-2:30 or by appointment
Luis von Ahn, Wean Hall 4110. Office Hours:
W 2:30-4:30 or by appointment
|
This course provides an introduction to formal languages, automata,
computability, and complexity. In the Fall of 2005, we will
emphasize complexity theory more heavily than in previous semesters.
The course
consists of a traditional lecture component supported by weekly homework
assignments and a course project. There are two midterms and a final
examination.
|
Textbook: Introduction to the Theory of Computation (2nd Ed.)
by
Michael Sipser, 2005.
Prerequisites: 15-212 and 15-251 (or 21-228).
Grading:
Homework, 20%; Class Participation, 5%; Midterm I, 15%; Midterm II, 15%;
Final, 30%; Project 15%. Attendance is
required.
Homework:
Homework is due one week after it is assigned. Late homework will be accepted only under exceptional
circumstances. Each student is to do their own work and hand in their own homeworks individually.
Collaboration is allowed, but
references used (including books, articles, websites, people) must be listed!
|
|
|
|