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.
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.
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.
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, Savitch's
Theorem, Space Hierarchy, Recursion Theorem.
This note
explains the theoretical computer science areas of formal languages and
automata, computability and complexity. Topics covered include: regular and
context-free languages, finite automata and pushdown automata, Turing
machines, Church's thesis, computability - halting problem, solvable and
unsolvable problems, space and time complexity, classes P, NP and PSPACE, NP-Completenes.
Author(s): The Australian National University, Canberra
This note covers the
following topics: Mathematical Perliminaries, Automata Theory, Combinatorics
and Graph Theory, DFAs to Regular Expressions- Brzozowski’s Algebraic Method,
Myhill-Nerode and DFA Minimization, Group Theory, Turing Machines and
Computability Theory, Complexity Theory.
This note explains the following topics: Symbols, strings and
languages, Finite automata, Regular expressions and languages, Markov models,
Context free languages, Language recognizers and generators, The Chomsky
hierarchy, Turing machines, Computability and actability, Computational
complexity.
This note
covers the following topics: Automata, Set Theory, The Natural numbers and
Induction, Foundations of Language Theory, Operations on Languages,
Deterministic Finite Automata, Formal Languages, Computability, Computations
of Turing Machines, The Primitive Recursive Functions, The Partial Recursive
Functions, DNA Computing, Analog Computing and Scientific Computing.
This is a free textbook for an undergraduate course
on the Theory of Computation, which have been teaching at Carleton University
since 2002.Topics covered includes: Finite Automata and Regular Languages,
Context-Free Languages, Turing Machines and the Church-Turing Thesis,
Decidable and Undecidable Languages and Complexity Theory.
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