This note
explains the following topics: Automata and Language Theory, Finite automata,
regular expressions, push-down automata, context-free grammars, pumping
lemmas, Computability Theory, Turing machines, Church-Turing thesis,
decidability, halting problem, reducibility, recursion theorem, Complexity
Theory, Time and space measures, hierarchy theorems, complexity classes P, NP,
PSPACE, complete problems, P versus NP conjecture, quantifiers and games,
provably hard problems, probabilistic computation.
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 PDF covers the
following topics related to Theory of Computation : Mechanical Computation,
Background, Languages and graphs, Automata, Computational Complexity.
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 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.
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 course is an introduction to
the Theory of Computation. Topics covered includes: Background Mathematics,
Models of Computation, Context-Free Grammars, Automata, The Chomsky
Hierarchy.
This lecture note covers the
following topics: Theory Of Computation, Introduction To Automata, Finite
Automata, Regular Expressions And Languages, Properties Of Regular Language,
Context-free Grammars And Languages, Applications Of Context-free Grammars,
Pushdown Automata, Properties of Context-Free Languages.
Author(s): Prof. D. Chandrasekhar Rao, Prof.
Kishore Kumar Sahu and Prof. Pradipta Kumar Das
This is an executable course note
implemented in Pidgin ML, which is a core subset of the Objective Caml
programming language under the so-called revised syntax.