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: 09/29/2004   Introduction 10/08/2004   Review of Proof Techniques 10/08/2004   Handout on Dovetailing and Diagonalization (ask instructor for copy) 10/25/2004   Regular Expressions and DFAs 10/29/2004   Converting NFAs to Regular Expressions (from Prof. Paul Beame's CSE 322) 10/29/2004   Pumping Lemma 11/01/2004   Midterm Review 11/12/2004   Pushdown Automata 11/19/2004   PDAs, CFGs, and Pumping Lemma Reincarnated 11/24/2004   Turing Machines 12/01/2004   Church-Turing Thesis and Closure (at last) 12/03/2004   Those Darn Undecidable Problems 12/10/2004   Chomsky and Final Review On-line resources and fun links: Finite Automaton Simulator - program a DFA. 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 (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]