Theory of Computation by Kyle Burke

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 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

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

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

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

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

A Computational Introduction to Number Theory and Algebra (V. Shoup)

This book introduces the basic concepts from computational number theory and algebra, including all the necessary mathematical background. Covered topics are: Basic properties of the integers, Congruences, Computing with large integers, Euclid’s algorithm, The distribution of primes, Abelian groups, Rings, Finite and discrete probability distributions, Probabilistic algorithms, Probabilistic primality testing, Finding generators and discrete logarithms in Zp, Quadratic reciprocity and computing modular square roots, Modules and vector spaces, Matrices, Subexponential-time discrete logarithms and factoring, Polynomial arithmetic and applications.

Author(s): Victor Shoup

NA Pages