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, accompanied by occasional group-based problem-solving sessions. Lecture Slides and Handouts: 10/01/2001   Introduction 10/05/2001   Proof Techniques 10/10/2001   Handout on Dovetailing and Diagonalization (ask instructor for copy) 10/26/2001   Equivalence of Regular Expressions and DFAs/NFAs 10/31/2001   Pumping Lemma 11/02/2001   Midterm Review 11/16/2001   Pushdown Automata 11/28/2001   CFLs/PDAs, Pumping, and Turing 12/05/2001   Varieties of Turing Machines and Closure 12/12/2001   Undecidability, Reducibility, and Final Review On-line resources and fun links: Finite Automaton Simulator - program a DFA. Nondeterministic Finite Automaton Simulator - program an NFA. Regular Expressions in Java - search for patterns in a text. Fun with Regular Expressions - a game for Regular Expression junkies. Pushdown Automaton Simulator - program a PDA (as well as FAs and Turing Machines). Turing Machine Simulator - program a Turing machine. The Theory of Computing Hall of Fame - read about Turing, Chomsky, and other greats UW's Steam-Powered Turing Machine (stop by the east stairwell in Sieg 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]