COMP 481: Automata, Formal Languages, and Computability
SPRING 2010

Staff

Course Announcements and Handouts

1. Jan 6: course syllabus (PDF).

Course Information

• Meeting time and place: T&Th 2:30 - 3:50; Duncan Hall 1042.
• Textbook: "Automata, Computability, and Complexity: Theory and Applications", Elaine Rich. Prentice Hall, 2008.
• Prerequisite: COMP 314 (mathematical maturity!).
• Topics: I expect to cover almost all chapters in the book (we will skip some sections). See the syllabus.
• Grading: There will be three components to your final grade: H (homework assignments), M (midterm), and F (final). Your final grade, GRADE, will be determined as follows:
  GRADE = 50%F + 25%M + 25%H (all grades are out of 100.)
• Information about the homework assignments and exams:
  • Homework: there will be 10 homework assignments. Collaboration is allowed and encouraged, but every student must write the solutions in his/her own words. Indicate clearly the name(s) of people you collaborated with.
  • Midterm: in-class, 2-hour exam, open-books and open-notes.
  • Final: in-class, 3-hour comprehensive exam, open-books and open-notes.
• Any student with a documented disability needing academic adjustments or accommodations is requested to speak with me during the first two weeks of class. All discussions will remain confidential. Students with disabilities will need to also contact Disability Support Services in the Ley Student Center.

Homework Assignments