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 
This note contains below topics, Strings and formal languages, Deterministic and nondeterministic finite automata, Regular expressions, Context free languages, Turing machines, Undecidability.
Author(s): Jeff Erickson, University of Illinois Urbana-Champaign
155 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
Lecture Notes Theory of Computation
This lecture note from S R Engineering College offers a detailed introduction to key concepts in the Theory of Computation. It begins with Properties of Binary Operations, exploring fundamental mathematical operations and their essential properties like associativity and commutativity. The section on Concatenation Properties covers how strings can be joined and the characteristics of such operations, including associativity and the identity element. Finite Automata are thoroughly discussed, explaining both deterministic and nondeterministic NFA models, and their role in recognizing regular languages. The notes also cover Formal Languages, categorizing them into regular, contextfree, contextsensitive, and recursively enumerable types based on complexity. Finally, the Pumping Lemma is introduced as a critical tool for proving the nonregularity and noncontextfreeness of languages by demonstrating how strings in these languages can be decomposed and manipulated.
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, Savitchs Theorem, Space Hierarchy, Recursion Theorem.
Author(s): Wikiversity
NA Pages
Theory of Computation Tutorials
This set of tutorials goes into the heart of the theory of computer science with formal languages and automatons, computability, and complexity. Topics to be discussed are regular and contextfree languages, finite automata, and pushdown automata. Consequently, resulting tutorials treat topics like Turing machines, Churchs thesis, and the problem of undecidability, whose examples include the and quot,halting problem and quot, in the exploration of the limits of computability. They look into complexity classes such as P, NP, and PSPACE, look into NPcompleteness, or provide an indepth treatment along with a wide introduction to the theoretical foundations of computer science.
Author(s): The Australian National University, Canberra
NA Pages
