Introduction to the Theory of Computation Lecture Notes and Exercises
This lecture notes contains following topics: Lecture Notes and Exercises for CSC, Overview of this Course, Prerequisite Knowledge, The Induction Idea, Complete Induction, Beyond Numbers, Structural Induction, A Larger Example, Exercises, Measuring Runtime, A Simple Recursive Function, A Special Recurrence Form, Quicksort, Exercises, Correctness of Recursive Programs, Iterative Programs, Termination, Exercises, Regular Languages, A Suggestive Flowchart, Deterministic Finite Automata, Correctness of DFAs, Limitations of DFAs, Nondeterminism, Exercises, introduction to the theory of computation, Concepts from MAT, introduction to the theory of computation
Author(s): David Liu Toronto University
75 Pages 
Introduction to the Theory of Computation Lecture Notes
This note covers Induction, Recursion, Program correctness, Regular languages and finite automata.
Author(s): University of Toronto
75 Pages
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.
Author(s): Margaret Fleck and Sariel Har Peled
345 Pages
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.
Author(s): University of Waterloo
227 Pages
Models of Computation by John E. Savage
This PDF Models of Computation by John E. Savage covers the following topics related to Computation Theory : The Role of Theory in Computer Science, General Computational Models, Logic Circuits, Machines with Memory, Finite-State Machines and Pushdown Automata, Computability, Algebraic and Combinatorial Circuits, Parallel Computation, Computational Complexity, Complexity Classes, Circuit Complexity, Space–Time Tradeoffs, Memory-Hierarchy Tradeoffs, VLSI Models of Computation.
Author(s): John E. Savage, Brown University
698 Pages
Lecture Notes Theory of Computation
This note covers the following topics: Properties of binary operations, Concantenation properties, Finite automata, Formal Languages, Pumping Lemma.
Author(s): S R Engineering College
155 Pages
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.
Author(s): BYU Computer Science Department
NA Pages
