THEORY OF COMPUTING
Com S 331
Handouts
Elements of the Theory of Computing by Lewis & Papadimtriou:
- Sections 1.4 and 1.5: Finite and Infinite Sets; Three Fundamental Proof Techniques.
Regular Expressions: - An example of DFA to Regex conversion.
Introduction to the Theory of Computation by Michael Sipser - Chapter 4: Decidability.
Section 5.1: Undecidability reductions.
Iowa State University - Computer Science Department - Top of this page