Computer Science BooksComputation Theory Books

Notes on Computation Theory

Advertisement

Notes on Computation Theory

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

s231 Pages

Advertisement

Advertisement

Similar Books
Introduction to the   Theory of Computation

Introduction to the Theory of Computation

This note explains the following topics: Automata and Language Theory, Finite automata, regular expressions, push-down automata, context-free grammars, pumping lemmas, Computability Theory, Turing machines, Church-Turing thesis, decidability, halting problem, reducibility, recursion theorem, Complexity Theory, Time and space measures, hierarchy theorems, complexity classes P, NP, PSPACE, complete problems, P versus NP conjecture, quantifiers and games, provably hard problems, probabilistic computation.

sNA Pages
Introduction to Theory of Computation

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.

s246 Pages
Great   Ideas in Theoretical Computer Science Lecture Notes

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.

sNA Pages
Introduction   to Theoretical Computer Science or Theory of Computation

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.

sNA Pages
Computation   Theory Lecture notes

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.

s93 Pages
ConstructiveComputation Theory

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.

sNA Pages