CSE 322 Lectures and Handouts

CSE Home

About Us

Search

Contact Info

Main page Administration  Syllabus  Workload and Grading  Instructor and TAs  Lectures  Email archive  Accommodations Assignments and exams  Assignments  Exams  Policies

Lectures will comprise of slides plus white-board based discussion of definitions, theorems, and examples. Lecture Slides and Handouts: 01/04/2006   Introduction 01/13/2006   Review of Proof Techniques 01/13/2006   Handout on Dovetailing and Diagonalization 01/30/2006   Regular Expressions and DFAs 01/30/2006   Converting NFAs to Regular Expressions (from Prof. Paul Beame's CSE 322) 02/01/2006   Pumping Lemma 02/08/2006   Midterm Review 02/15/2006   Pushdown Automata 02/27/2006   PDAs, CFGs, and Pumping Lemma Reincarnated 03/01/2006   Turing Machines 03/03/2006   Varieties of Turing Machines and the Church-Turing Thesis 03/06/2006   Closure (at last) 03/08/2006   Those Darn Undecidable Problems and their Reducibility 03/10/2006   Chomsky and Final Review On-line resources and fun links: Automaton and Turing Machine Simulator - program a DFA, PDA or TM. Regular Expressions in Java - search for patterns in a text. Fun with Regular Expressions - a game for Regular Expression junkies. Another Turing Machine Simulator - watch the action unroll on a tape! The Theory of Computing Hall of Fame - read about Turing, Chomsky, and other greats UW's Steam-Powered Turing Machine (picture at CSE Reception and in the east stairwell in Sieg Hall between the 2nd and 3rd floors).

	Department of Computer Science & Engineering University of Washington Box 352350 Seattle, WA  98195-2350 (206) 543-1695 voice, (206) 543-2969 FAX [comments to rao@cs.washington.edu]