Models of Computation by John E. Savage
This book, written for graduates, covers general subjects on computational models, logic circuits, and memory machines, with advanced subjects being parallel computation, circuit complexity, and space-time trade-offs; therefore, it's a very thorough course on computational models and their complexities.
Author(s): John E. Savage, Brown University
698 Pages 
This note contains below topics, Alphabets, strings, languages, and finite automata, Regular sets, regular expressions, and regular grammars, Context free grammars and languages, Pushdown automata, Turing machines and computability.
Author(s): P Anjaiah, B Ramyasree, E Umashankari, and A Jayanthi, Institute of Aeronautical Engineering
158 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 Kyle Burke
This pdf begins with an overview of resources, organization and motivation and preview of CS theory covering the Limits of Computation, the Undecidability of the Halting Problem.The Automata and Machines including Deterministic and Nondeterministic Finitestate Automata, Pushdown Automata, and Turing Machines and Language Classes. Finally focus shifts to Computational Complexity, discussing NPCompleteness, Approximation Algorithms, and the Hardness of Approximation.
Author(s): Kyle Burke
114 Pages
Models of Computation by John E Savage
This PDF Models of Computation by John E. Savage covers the following topics related to Computation Theory, The Role of Theory in Computer Science, General Computational Models, Logic Circuits, Machines with Memory, FiniteState Machines and Pushdown Automata, Computability, Algebraic and Combinatorial Circuits, Parallel Computation, Computational Complexity, Complexity Classes, Circuit Complexity, SpaceTime Tradeoffs, MemoryHierarchy Tradeoffs, VLSI Models of Computation.
Author(s): John E. Savage, Brown University
698 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, Savitchs Theorem, Space Hierarchy, Recursion Theorem.
Author(s): Wikiversity
NA Pages
