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 
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
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 Finite-state Automata, Pushdown Automata, and Turing Machines and Language Classes. Finally focus shifts to Computational Complexity, discussing NP-Completeness, Approximation Algorithms, and the Hardness of Approximation.
Author(s): Kyle Burke
114 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
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
Introduction to Theory of Computation Lecture Notes
This note explains the following topics: Discrete mathematics, Deterministic Finite Automata, Nondeterministic Finite Automata, Equivalence of DFA and NFA, Nondeterministic Finite Auotmata, egular expressions and finite automata, Non-regular languages and Pumping Lemma, Myhill-Nerode Theorem, Context-free languages and Ambiguity, Closure Properties, Pumping Lemma and non-CFLs, Closure Properties and non-CFL Languages, Decidable and Recognizable Languages.
Author(s): Mahesh Viswanathan
NA Pages
Advanced Theory in Computation
This note covers the following topics: Analysis of Algorithms, String Matching, Amortized Analysis, Knuth-Morris-Pratt Algorithm, Pattern-Matching Machine, Boyer-Moore Algorithm, Horspool Algorithm, Suffix Trees, Dictionary Techniques, Ziv-Lempel Coding, Randomized Algorithms, Reservation-Price-Policy, Portfolio Selection, Statistical Adversaries.
Author(s): Seoul National University
NA Pages
