The Theory of Languages and Computation

Lecture Notes of Introduction to the Theory of Computation

Authored by Margaret Fleck and Sariel Har Peled, this is a wide set of lecture notes on the theory of computation. These start with the very basic objects such as strings and deterministic finite automata (DFAs) before moving up to regular expressions and nondeterministic automata. This course covers formal language theory, including some advanced topics such as Turing machines, decidability, and several language-related problems. It is intended that these notes afford a comprehensively broad yet deep exploration of the formal languages, automata, and computability material with an excellent bibliography that creates interest among students and researchers.

Author(s): Margaret Fleck and Sariel Har Peled

345 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

Models of Computation by John E. Savage

This book, written for graduates, covers general subjects on computational models, logic circuits, and memory machines, with advanced subjects being parallel computation, circuit complexity, and space-time trade-offs; therefore, it's a very thorough course on computational models and their complexities.

Author(s): John E. Savage, Brown University

698 Pages

Lecture Notes Theory of Computation

This lecture note from S R Engineering College offers a detailed introduction to key concepts in the Theory of Computation. It begins with Properties of Binary Operations, exploring fundamental mathematical operations and their essential properties like associativity and commutativity. The section on Concatenation Properties covers how strings can be joined and the characteristics of such operations, including associativity and the identity element. Finite Automata are thoroughly discussed, explaining both deterministic and nondeterministic (NFA) models, and their role in recognizing regular languages. The notes also cover Formal Languages, categorizing them into regular, context-free, context-sensitive, and recursively enumerable types based on complexity. Finally, the Pumping Lemma is introduced as a critical tool for proving the non-regularity and non-context-freeness of languages by demonstrating how strings in these languages can be decomposed and manipulated.

Author(s): S R Engineering College

155 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

Advanced Theory in Computation

This is an advanced set of notes on the analysis of algorithms and their complexity. Of interest in these notes are the topics on string matching algorithms, such as Knuth-Morris-Pratt and Boyer-Moore. Suffix trees and dictionary techniques are also part of the discussion here. Among the methods to be shown in a way of analyzing algorithm efficiency are amortized analysis and randomized algorithms. It also treats the pairing technique, Ziv-Lempel coding; further topics on statistical adversaries, portfolio selection, and reservation-price policies that are objects of other techniques discussed herein.

Author(s): Seoul National University

NA Pages