CSC 448/2405: Formal Languages and Automata
Winter, 2006

Students should consult this page at least once a week for important information.

Lectures: Friday 9-11 RW 229

Tutorial: NOTE CHANGE: Monday 10-11, and Tues 5-6pm
NOTE: THE LAST TUTORIAL WILL BE HELD AT THE ORIGINAL TIME, MONDAY 11-12, IN THE ORIGINAL ROOM RW229.

Instructor: Toniann Pitassi, email: toni@cs
Office: Sandford Fleming 2305A, 978-3695
Office Hours: Friday 2-3pm and by appointment

Text: Introduction to the Theory of Computation, by Michael Sipser.

Teaching Assistant: Periklis Papakonstantinou

Course Information Sheet

HOMEWORK ASSIGNMENTS:

• Homework 1 NOTE: I updated HW1 in case you have the old version of Sipser. Also, the last problem (on minimization of DFA's) is not due until Friday, February 10th.
• Homework 2
• Homework 3 NOTE: You have an extension on question 5c. It will not be due until Wednesday, April 12th. The extra credit problem (problem 6) is also not due until Wednesday, April 12th.

HANDOUTS:

• Turing machine computation handout

GRADES:

• Grades for Homework 1 and Test 1
• Grades for Homework 1, Test 1, Homework 2, Test2
• Final grades

SUPPLEMENTARY READING:

Hopcroft and Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley Publishing Company.