Introduction to Theory of Computation by Wikiversity

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

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

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

The Theory of Languages and Computation

This note covers the following topics: Automata, Set Theory, The Natural numbers and Induction, Foundations of Language Theory, Operations on Languages, Deterministic Finite Automata, Formal Languages, Computability, Computations of Turing Machines, The Primitive Recursive Functions, The Partial Recursive Functions, DNA Computing, Analog Computing and Scientific Computing.

Author(s): Jean Gallier and Andrew Hicks

109 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

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

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