Introduction to the Theory of Computing
Introduction to the Theory of Computing is a course that undertakes an intensive study of the underpinnings of the theory of computation. Beginning with mathematical foundations, the course moves into regular operations and expressions, and then into proofs on languages being nonregular and other further treatments on regular languages. Other important topics include parse trees, ambiguity, Chomsky normal form, pushdown automata, and Turing machines. Further, the PDF discusses various types of Turing machines, the stack machine model, and undecidable languages, making it a great starting point in the topic of computability.
Author(s): University of Waterloo
227 Pages 
Introduction to the Theory of Computation Lecture Notes
These are lecture notes from the University of Toronto, giving a very brief introduction to some of the basic ideas in the theory of computation. We start with some basic topics: induction and recursion; the correctness of programs, that must be understood if more advanced computational theories are to be enlightened. Then we go on to develop the topics of regular languages and finite automata, giving the basic models and techniques used in analysing and recognising regular languages. The coverage is designed to provide students with a reasonably solid grounding in the basic ideas of the theory of computation and to render a clear and thorough exposition of the fundamental concepts underlying more advanced topics.
Author(s): University of Toronto
75 Pages
Introduction to the Theory of Computing
Introduction to the Theory of Computing is a course that undertakes an intensive study of the underpinnings of the theory of computation. Beginning with mathematical foundations, the course moves into regular operations and expressions, and then into proofs on languages being nonregular and other further treatments on regular languages. Other important topics include parse trees, ambiguity, Chomsky normal form, pushdown automata, and Turing machines. Further, the PDF discusses various types of Turing machines, the stack machine model, and undecidable languages, making it a great starting point in the topic of computability.
Author(s): University of Waterloo
227 Pages
Theory of Computation by Kyle Burke
This book surveys some of the most relevant theoretical concepts with computational models. The limits of computation, undecidability of the Halting Problem, several automata models, including both deterministic and nondeterministic finite-state automata, pushdown automata, and Turing machines, are introduced. The ending is dedicated to computational complexity, with NP-Completeness, approximation algorithms, and hardness of approximation.
Author(s): Kyle Burke
114 Pages
Introduction to Theory of Computation by Wikiversity
This is an all-inclusive course on computational theory provided in this online resource by Wikiversity. It begins with Finite State Machines–their definitions, operations, and minimization techniques. The notes also cover closure and nondeterminism—how these properties may affect computational models. Their discussion greatly involves the Pumping Lemma, proving language property. The book also surveys Context-Free Languages and their connection to Compilers and introduces Pushdown Machines emphatically and focuses on their importance in parsing. It contains important material on the CYK algorithm for parsing and the more basic problems of Undecidability. It also surveys Turing Machines, the Halting Problem, and more general areas of Complexity Theory, including Quantified Boolean Formulae, Savitch's Theorem, and Space Hierarchy. The notes end with the Recursion Theorem, and it can be considered as a landmark in the theoretical study of the science of computers.
Author(s): Wikiversity
NA Pages
Introduction to Computational Theory Lecture Notes
These broad-ranging notes introduce some of the fundamental concepts in the theory of computation. The set starts with a brief introduction to formal languages and their classification, including regular languages and sets. In these notes, finite automata are introduced, discussing their structure and role in recognizing regular languages. This is followed by Context-Free Grammars and Pushdown Automata, focusing on the role in defining and recognizing context-free languages. This will cover Turing Machines, the original model of computation; a review of the Chomsky Hierarchy from a perspective on the various levels of languages about their power of generation. The conclusion deals with an overview of Complexity Theory, mainly dealing with the P and NP problems. It gives insight into the computational complexity in general and into the famous P vs NP questions.
Author(s): BYU Computer Science Department
NA Pages
Introduction to Theory of Computation Lecture Notes
These lecture notes give an introduction to the more fundamental parts of the theory of computation and begin by presenting finite automata: starting with deterministic and nondeterministic finite automata, their equivalence, and practical implications of these concepts. The lecture notes include sections on regular expressions and their relationship to finite automata, non-regular languages, and the Pumping Lemma to prove non-regularity. Myhill-Nerode Theorem: For understanding recognition of languages. The notes go further to present context-free languages, including their ambiguity and properties of closure. The pumping lemma for context-free languages is also discussed, while decidable and recognizable languages are informed by a deep underpinning in computational theory.
Author(s): Mahesh Viswanathan
NA Pages
