Theory of Computation by S. Arun Kumar

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

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

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

Notes on Computation Theory

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

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

Introduction to Theory of Computation

This is a free textbook for an undergraduate course on the Theory of Computation, which have been teaching at Carleton University since 2002.Topics covered includes: Finite Automata and Regular Languages, Context-Free Languages, Turing Machines and the Church-Turing Thesis, Decidable and Undecidable Languages and Complexity Theory.

Author(s): Anil Maheshwari and ichiel Smid

246 Pages

Theory of Computation

This note covers the following topics: A brief history of computing, Fundamentals, Formal languages and machine models, Computability and undecidability, NP-completeness, Generalized number systems and Cryptography mental poker.

Author(s): Dr. Gabriel Robins

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