This section contains free e-books and guides on Computation Theory, some of the resources in this section can be viewed online and some of them can be downloaded.
Theory Of Computation Lecture NotesProf. D. Chandrasekhar Rao, Prof.
Kishore Kumar Sahu and Prof. Pradipta Kumar Das PDF
| 120 Pages
This lecture note covers the
following topics: Theory Of Computation, Introduction To Automata, Finite
Automata, Regular Expressions And Languages, Properties Of Regular Language,
Context-free Grammars And Languages, Applications Of Context-free Grammars,
Pushdown Automata, Properties of Context-Free Languages.
Introduction to theory of computation by Tom CarterTom
| 76 Pages
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
The Theory of Languages and ComputationJean Gallier and Andrew HicksPDF
| 109 Pages
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.
Introduction to Theory of ComputationAnil
Maheshwari and ichiel SmidPDF
| 246 Pages
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.
Theory of Computation by S. Arun KumarS. Arun KumarPDF
| 83 Pages
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
Theory of ComputationDr.
| NA Pages
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.
Great Ideas in Theoretical Computer Science Lecture NotesProf. Scott
| NA Pages
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.
Introduction to Theoretical Computer Science or Theory of ComputationPavan
Kumar Anumula, Andrea Di Fabio and Jia Zhu Online
| NA Pages
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
Computation Theory Lecture notesProf Anuj DawarOnline
| 93 Pages
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
ConstructiveComputation TheoryGerard HuetOnline
| NA Pages
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.
A Computational Introduction to Number Theory and Algebra (V. Shoup)Victor
| NA Pages
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.