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 
This note contains below topics, Alphabets, strings, languages, and finite automata, Regular sets, regular expressions, and regular grammars, Context free grammars and languages, Pushdown automata, Turing machines and computability.
Author(s): P Anjaiah, B Ramyasree, E Umashankari, and A Jayanthi, Institute of Aeronautical Engineering
158 Pages
This note contains below topics, Strings and formal languages, Deterministic and nondeterministic finite automata, Regular expressions, Context free languages, Turing machines, Undecidability.
Author(s): Jeff Erickson, University of Illinois Urbana-Champaign
155 Pages
Theory of Computation by Frank Stephan
This note explains the following topics, sets and regular expressions, Grammars and the chomsky hierarchy, Finite automata, Nondeterministic finite automata, Combining languages, Normal forms and algorithms, Deterministic membership testing, Nondeterministic membership testing, Models of computation, Complexity considerations, Undecidable problems, Undecidability and formal languages.
Author(s): Frank Stephan
176 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, contextfree, contextsensitive, and recursively enumerable types based on complexity. Finally, the Pumping Lemma is introduced as a critical tool for proving the nonregularity and noncontextfreeness of languages by demonstrating how strings in these languages can be decomposed and manipulated.
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, ContextFree Grammars, Pushdown Automata and ContextFree Languages, Turing Machines, The Chomsky Hierarchy, P and NP.
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, nonregular languages, and the Pumping Lemma to prove nonregularity. MyhillNerode Theorem, For understanding recognition of languages. The notes go further to present contextfree languages, including their ambiguity and properties of closure. The pumping lemma for contextfree languages is also discussed, while decidable and recognizable languages are informed by a deep underpinning in computational theory.
Author(s): Mahesh Viswanathan
NA Pages
