The Steam Powered Turing Machine University of Washington Department of Computer Science & Engineering
 CSE 322: Introduction to Formal Models in Computer Science, Winter 2007
  CSE Home   CSE 322 Home  About Us    Search    Contact Info 

Email
  Archive 
  Sign-up Instructions
Homework Assignments
  Assignment #1
  Assignment #2
  Assignment #3
  Assignment #4
  Assignment #5
  Assignment #6
  Assignment #7
  Assignment #8
  Sols to Assignment #8
Reading Assignments
  Read Section 4.2
  Skim Sections 3.1, 3.3
  Read Section 2.3
  Bottom-up Parsing 
  Read Section 2.2
  CKY algorithm and example 
  Chomsky Example  
  Chomsky Normal Form 
  Read Section 2.1
  Minimizing DFAs 
  Myhill-Nerode Theorem 
  Pattern Matching 
  Regular Expressions from NFAs 
  Proof of Subset Construction 
  Defining Delta Star 
  Read Chapter 1
  Tape Recorder Example 
  Review Chapter 0
Administrative
  Final Exam Topics
  Midterm Topics
  Syllabus
  Homework Policy
   
MWF 1:30-2:20    MGH 231

Office Hours Location Phone
Instructor: Paul Beame   beame at cs  
MW 2:20-2:50
W 11:00-11:50
CSE 668 543-5114
TAs: Widad Machmouchi    widad at cs   Th 12:00-1:50 CSE 218
Gyanit Singh   gyanit at cs   W 3:00-3:50 CSE 216

Textbook

Michael Sipser, Introduction to the Theory of Computation. Either the first or second editions will work. Although the numbering of almost everything in the two editions is different, the content is mostly unchanged except that the second edition contains some new and solved problems. The international edition content is also OK though the problem numbers may differ from both U.S. editions. (Second edition errata: first printing. First edition errata: first printing , later printings .)

Mailing List

There is a class mailing list, cse322. Follow the link in the left column on this page to sign up. Everyone is expected to be reading cse322 e-mail to keep up-to-date on the course.

Grading

Homework 45-55%, midterm 15-20%, final 30-35%, give or take. Extra Credit.

Midterm Exam

In class on February 7. The midterm will cover up to end of the material on Finite Automata and Regular Languages, except for the part on minimizing DFAs. There is List of Midterm Topcs. Here is a sample midterm from a previous offering I gave. Here is another sample midterm. There will be a review session Tuesday, February 6 at 4:30. Location EEB-037.

Final Exam:

The final exam will be at the time listed in the official exam schedule which is 2:30-4:20 p.m. Monday March 12. There is a list of final exam topics as well as a sample final exam. There will be a review session Sunday, March 11 at 3:00 p.m. in EEB 037.

Suggestions or Comments? You can send comments to the instructor or TA using this anonymous feedback form


Portions of the CSE 322 Web may be reprinted or adapted for academic nonprofit purposes, providing the source is accurately quoted and duly credited. The CSE 322 Web: © 1993-2007, Department of Computer Science and Engineering, University of Washington.