Languages and Automata

CSCI 250-01

Spring 2008 Semester

The course syllabus.

Listing of the text's errata.

Instructor's Home Page and current schedule.

Extra Credit Opportunities.

• Create a (Java/C++) class to behave like a combination lock. (Due: By the end of the penultimate week of classes)

The reading assignments.

Homework Assignments:
Guidelines for writing up the homework assignments

• Homework 9: NP-Completeness (Extended! Due 5/2/08)
• Homework 8: Proofs of Unsolvability (Extended! Due 4/23/08)
• Homework 7: Playing with Turing Machines (Due 4/4/08)
• Homework 6: The pumping lemma for CFL's (Due 3/12/08)
• Homework 5: Playing with PDAs (Due: Extended to 3/3/08)
• Homework 4: Playing with Context-Free Grammars (Due 2/22/08)
• Homework 3: The pumping lemma for Reg. Languages. (Due 2/11/08)
• Homework 2: DFA's, NFA's and Regular Expressions. (Due 2/1/08)
• Homework 1: Playing with Finite Automata. (Due 1/25/08)

Lecture notes on some of the key theorems of the semester.

Examinations:

• The first midsemester examination is tentatively scheduled for Wednesday February 13, 2008.
  • A Study Guide for you to peruse.
     
• The second midsemester examination is scheduled for: Friday March 14, 2008.
  • A Study Guide for you to peruse.
     
• The final (cumulative) examination is scheduled for Wednesday May 7, 2008 (10:30-12:20).