Introduction to Theoretical Computer Science or Theory of Computation
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 and complexity.
Author(s): Pavan Kumar Anumula, Andrea Di Fabio and Jia Zhu
NA 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 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 languagerelated problems it offers a comprehensive look at formal languages, automata, and computability.
Author(s): Margaret Fleck and Sariel Har Peled
345 Pages
Introduction to Theory of Computation by Wikiversity
This note describes the following topics, Finite State Machines, Closure and Nondeterminism, The Pumping Lemma, Minimizing FSMs, Context Free Languages, CFLs and compilers, Recitation, Pushdown Machines, CFGs and NPDMs, CYK algorithm, Undecidability and CFLs, Turing Machines, Halting Problem, Decidability, Complexity Theory, Quantified Boolean Formula, Savitchs Theorem, Space Hierarchy, Recursion Theorem.
Author(s): Wikiversity
NA Pages
Theory of Computation Tutorials
This set of tutorials goes into the heart of the theory of computer science with formal languages and automatons, computability, and complexity. Topics to be discussed are regular and contextfree languages, finite automata, and pushdown automata. Consequently, resulting tutorials treat topics like Turing machines, Churchs thesis, and the problem of undecidability, whose examples include the and quot,halting problem and quot, in the exploration of the limits of computability. They look into complexity classes such as P, NP, and PSPACE, look into NPcompleteness, or provide an indepth treatment along with a wide introduction to the theoretical foundations of computer science.
Author(s): The Australian National University, Canberra
NA Pages
