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 
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
Lecture Notes of Introduction to the Theory of Computation
This note exlains the following topics: foundational concepts like strings and DFAs, then progresses to regular expressions, nondeterministic automata, and formal language theory, Advanced topics include Turing machines, decidability, and language-related problems it offers a comprehensive look at formal languages, automata, and computability.
Author(s): Margaret Fleck and Sariel Har Peled
345 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 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 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
