image University of Washington Computer Science & Engineering
  CSE 322Au '07:  Introduction to Formal Models in Computer Science
  CSE Home   About Us    Search    Contact Info 

 Schedule & Reading
 Midterm Review (1-up4-up)
 Final Review (1-up4-up)
 Class List Archive
 E-mail Course Staff
 HW #1
      Scanned Problems
 HW #2
 HW #3
 HW #4
 HW #5
 HW #6
 HW #7
Lecture Notes
 Lecture 1, 9/26
 Lecture 2, 9/28
 Lecture 3, 10/1
 Lecture 4, 10/3
 Lecture 5, 10/5
 Lecture 6, 10/8
 Lecture 7, 10/10
      NFA to DFA Notes
 Lecture 8, 10/12
 Lecture 9, 10/15
 Lecture 10, 10/17
 Lecture 11, 10/19
 Lecture 12, 10/22
 Lecture 13, 10/24
 Lecture 14, 10/26
 Lecture 15, 10/29
 Lecture 16, 10/31
 Lecture 17, 11/2
 Lecture 18, 11/5
 Lecture 19, 11/7
 Lecture 20, 11/9
 Lecture 21, 11/12
 Lecture 22, 11/14
 Lecture 23, 11/16
      CFG to PDA Notes
 Lecture 24, 11/19
 Lecture 25, 11/21 (1-up4-up)
 Lecture 26, 11/23
 Lecture 27, 11/26 (1-up4-up)
 Lecture 28, 11/28
 Lecture 29, 11/30
 Lecture 30, 12/3
 Lecture 31, 12/5 (1-up4-up)
 Lecture 32, 12/7

Lecture:  EEB 037 (schematic) MWF 1:30- 2:20 
Office Hours Phone
Instructor:  Larry Ruzzo, ruzzo at cs  F 12:00- 1:00  CSE 554  543-6298
TAs:  Zizhen Yao, yzizhen at cs  Th 12:30- 1:30  CSE 216 
  Slava Chernyak, chernyak at cs  Tu 10:30- 11:20  CSE 216 
  Sierra Michels-Slettvet, sierra at cs  W 12:00- 1:20  CSE 216 

Course Email: Use this list to ask and/or answer questions about homework, lectures, etc. The instructor and TAs are subscribed to this list. All messages are automatically archived.  Questions not of general interest may be directed to the instructor and/or TAs collectively (via the "course staff" link at left) or separately (via email addresses above.). You can (probably should) change your subscription options.

Catalog Description: Finite automata and regular expressions; context-free grammars and pushdown automata; nondeterminism; Turing machines and the halting problem. Emphasis on understanding models and their applications and on rigorous use of basic techniques of analysis. Induction proofs, simulation, diagonalization, and reduction arguments.

Prerequisite: CSE 321

Credits: 3

Grading: Homework, Midterm, Final. Homework may include some programing. Overall weights very roughly: HW 55%, midterm 15%, final 30%.

Late Policy: Unless otherwise announced, papers and/or electronic turnins are due at the start of class on the due date. 10% off for up to one day late (business day, e.g., Monday for Friday due dates); additional 20% per day thereafter.

Extra Credit: Some assignments will include "extra credit" sections. These will enrich your understanding of the material, but at a low points per hour ratio. Do them for the glory, not the points, and don't even think about starting the extra credit portion until the main problems are complete.

Collaboration: Homeworks are all individual, not group, exercises. Discussing them with others is fine, even encouraged, but you must produce your own homework solutions. Follow the "Gilligan's Island Rule": if you discuss the assignment with someone else, don't keep any notes (paper or electronic) from the discussion, then go watch 30+ minutes of mind-numbing TV (Gilligan's Island reruns especially recommended) before you continue work on the homework by yourself. You may not look at other people's written solutions to these problems, not in your friends' notes, not in the dorm files, not on the internet, ever. If in any doubt about whether your activities cross allowable boundaries, tell us before, not after, you turn in your assignment. See also the UW CSE Academic Misconduct Policy, and the links there.


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.

CSE logo Computer Science & Engineering
University of Washington
Box 352350
Seattle, WA  98195-2350
(206) 543-1695 voice, (206) 543-2969 FAX