Introduction to the Theory of Computation Lecture Notes and Exercises
This lecture notes contains following topics: Lecture Notes and Exercises for CSC, Overview of this Course, Prerequisite Knowledge, The Induction Idea, Complete Induction, Beyond Numbers, Structural Induction, A Larger Example, Exercises, Measuring Runtime, A Simple Recursive Function, A Special Recurrence Form, Quicksort, Exercises, Correctness of Recursive Programs, Iterative Programs, Termination, Exercises, Regular Languages, A Suggestive Flowchart, Deterministic Finite Automata, Correctness of DFAs, Limitations of DFAs, Nondeterminism, Exercises, introduction to the theory of computation, Concepts from MAT, introduction to the theory of computation
Author(s): David Liu Toronto University
75 Pages 
Theory of Computation by Frank Stephan
This note explains the following topics: sets and regular expressions, Grammars and the chomsky hierarchy, Finite automata, Nondeterministic finite automata, Combining languages, Normal forms and algorithms, Deterministic membership testing, Nondeterministic membership testing, Models of computation, Complexity considerations, Undecidable problems, Undecidability and formal languages.
Author(s): Frank Stephan
176 Pages
Introduction to the Theory of Computing
This pdf includes overview and mathematical foundations, Regular operations and regular expressions, Proving languages to be nonregular, Further discussion of regular languages, Parse trees, ambiguity, and Chomsky normal form, Pushdown automata, Turing machines, Variants of Turing machines, Stack machines, Universal Turing machines and undecidable languages, Further discussion of computability.
Author(s): University of Waterloo
227 Pages
Theory of Computation by Jim Hefferon
This PDF covers the following topics related to Theory of Computation : Mechanical Computation, Background, Languages and graphs, Automata, Computational Complexity.
Author(s): Jim Hefferon
439 Pages
Lecture Notes Theory of Computation
This note covers the following topics: Properties of binary operations, Concantenation properties, Finite automata, Formal Languages, Pumping Lemma.
Author(s): S R Engineering College
155 Pages
Introduction to Theory of Computation by Wikiversity
This note describes the following topics: Finite State Machines, Closure and Nondeterminism, The Pumping Lemma, Minimizing FSMs, Context Free Languages, CFLs and compilers, Recitation, Pushdown Machines, CFGs and NPDMs, CYK algorithm, Undecidability and CFLs, Turing Machines, Halting Problem, Decidability, Complexity Theory, Quantified Boolean Formula, Savitch's Theorem, Space Hierarchy, Recursion Theorem.
Author(s): Wikiversity
NA Pages
Introduction to Computational Theory Lecture Notes
This note covers the following topics: Languages, Finite Automata, Regular Languages and Sets, Context-Free Grammars, Pushdown Automata and Context-Free Languages, Turing Machines, The Chomsky Hierarchy, P and NP.
Author(s): BYU Computer Science Department
NA Pages
