CS220 - Models of Computation

Dr. Jonathan Senning's Lecture Slides

Introduction
   Closures and Algorithms (PDF)
   Alphabets and Languages (PDF)
   Recursive Definitions (PDF)
Regular Languages
   Regular Expressions and Languages (PDF)
   Deterministic Finite Automata (PDF)
   Nondeterministic Finite Automata (PDF)
   Kleene's Theorem (PDF)
Context-Free Languages
   Nonregular Languages (PDF)
   Context-Free Grammars and Languages (PDF)
   Parse Trees (PDF)
   Pushdown Automata (PDF)
   Pushdown Automata and Context-Free Grammars (PDF)
   The CYK Algorithm (PDF)
Non-Context Free Languages
   Non-Context-Free Languages (PDF)
   Turing Machines (PDF)
   Computing with Turing Machines (PDF)
   Universal Turing Machines (PDF)
   The Halting Problem (PDF)
   Properties of Recursive Languages (PDF)
Complexity
   Computational Complexity; The Class P (PDF)
   Boolean Satisfiability; The Class NP (PDF)
   NP Completeness (PDF)
©2007 Stephen Brinton, All rights Gordon College stephen.brinton@gordon.edu