Computer Science BooksComputation Theory Books

Introduction to theory of computation by Tom Carter

Introduction to theory of computation by Tom Carter

Introduction to theory of computation by Tom Carter

This note explains the following topics: Symbols, strings and languages, Finite automata, Regular expressions and languages, Markov models, Context free languages, Language recognizers and generators, The Chomsky hierarchy, Turing machines, Computability and actability, Computational complexity.

Author(s):

s76 Pages
Similar Books
Introduction to the Theory of Computation Lecture Notes

Introduction to the Theory of Computation Lecture Notes

This note covers Induction, Recursion, Program correctness, Regular languages and finite automata.

s75 Pages
Lecture Notes of Introduction to the Theory of Computation

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.

s345 Pages
Introduction to the Theory of Computing

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.

s227 Pages
Introduction   to Theory of Computation by Wikiversity

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.

sNA Pages
Introduction to   Computational Theory Lecture Notes

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.

sNA Pages
Advanced   Theory in Computation

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.

sNA Pages