Introduction to Theory of Computation Lecture Notes

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

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

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

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 Lectures

This note covers the following topics: Sets, functions and other preliminaries, Formal Languages, Finite Automata , Regular Expressions, Turing Machines, Context-Free Languages, Rice's Theorem, Time complexity, NP-Completeness, Space Complexity , Log Space, Oracle machines and Turing Reducibility, Probabilistic Complexity, Approximation and Optimisation, Complexity Hierarchy Theorems.

Author(s): UNSW Sydne

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

Great Ideas in Theoretical Computer Science Lecture Notes

This course note provides a challenging introduction to some of the central ideas of theoretical computer science. It attempts to present a vision of computer science beyond computers: that is, CS as a set of mathematical tools for understanding complex systems such as universes and minds.

Author(s): Prof. Scott Aaronson

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

ConstructiveComputation Theory

This is an executable course note implemented in Pidgin ML, which is a core subset of the Objective Caml programming language under the so-called revised syntax.

Author(s): Gerard Huet

NA Pages