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, Finite-State Machines and Pushdown Automata, Computability, Algebraic and Combinatorial Circuits, Parallel Computation, Computational Complexity, Complexity Classes, Circuit Complexity, Space–Time Tradeoffs, Memory-Hierarchy Tradeoffs, VLSI Models of Computation.
Author(s): John E. Savage, Brown University
698 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, Finite-State Machines and Pushdown Automata, Computability, Algebraic and Combinatorial Circuits, Parallel Computation, Computational Complexity, Complexity Classes, Circuit Complexity, Space–Time Tradeoffs, Memory-Hierarchy 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, 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
Theory of Computation Tutorials
This note explains the theoretical computer science areas of formal languages and automata, computability and complexity. Topics covered include: regular and context-free languages, finite automata and pushdown automata, Turing machines, Church's thesis, computability - halting problem, solvable and unsolvable problems, space and time complexity, classes P, NP and PSPACE, NP-Completenes.
Author(s): The Australian National University, Canberra
NA Pages
This course is an introduction to the Theory of Computation. Topics covered includes: Background Mathematics, Models of Computation, Context-Free Grammars, Automata, The Chomsky Hierarchy.
Author(s): Konrad Slind
231 Pages
Notes on Computational Complexity Theory
This note provides an introduction to the theory of computational complexity. Topics covered includes: Models of computation, Time and space complexity classes, Nonterminism and NP, Diagonalization, Oracles and relativization, Alternation, Space complexity, Natural proofs, Randomized classes, Counting classes, Descriptive complexity and Interactive proofs.
Author(s): James Aspnes
180 Pages
Theory Of Computation Lecture Notes
This lecture note covers the following topics: Theory Of Computation, Introduction To Automata, Finite Automata, Regular Expressions And Languages, Properties Of Regular Language, Context-free Grammars And Languages, Applications Of Context-free Grammars, Pushdown Automata, Properties of Context-Free Languages.
Author(s): Prof. D. Chandrasekhar Rao, Prof. Kishore Kumar Sahu and Prof. Pradipta Kumar Das
120 Pages
Theory of Computation by S. Arun Kumar
This book covers the following topics: The RAM Model, The Primitive Recursive Functions, The Partial Recursive Functions, Coding and Godelization, The Hierarchy of Primitive Recursive Functions, Universality and Parametrisation, The type-free lambda calculus.
Author(s): S. Arun Kumar
83 Pages
Introduction to Theoretical Computer Science or Theory of Computation
This note covers the following topics: introduction to theoretical computer science, language, regular language, finite automata, language accepted by dfa, nondeterministic finite automata, equivalence of nfa, regular language and fa, application of fa, nonregular languages, context free languages, turing machines, computability and complexity.
Author(s): Pavan Kumar Anumula, Andrea Di Fabio and Jia Zhu
NA Pages
Computation Theory Lecture notes
The aim of this course note is to introduce several apparently different formalisations of the informal notion of algorithm; to show that they are equivalent; and to use them to demonstrate that there are incomputable functions and algorithmically undecidable problems.
Author(s): Prof Anuj Dawar
93 Pages
