Theory of Computation Hand Note


Only Registered Users can Download this Product. If You not Registered or Logined. then

Login Now  or    Register/ Sign UP


Total Views : 540 , Today Views : 1 

Theory of Computation Hand Note

Page Length : 273

Cover Topic :

  • Introduction
  • BNF
  • Languages and grammars (most important!)
  • DFAs and their implementation
  • NDFAs and their implementation
  • DFAs = NDFAs
  • Regular expressions
  • Regular expressions denote regular languages
  • Regular grammars
  • Closure, homomorphism
  • Pigeonhole principle, pumping lemma (difficult)
  • CFGs
  • Parsing and ambiguity
  • Pushdown automata
  • NPDAs & CFGs
  • A pumping lemma for cfgs (still difficult)
  • Turing machines
  • Universal Turing Machines and LBAs
  • Recursively enumerable languages
  • Unrestricted grammars
  • The Chomsky hierarchy
  • Undecidable problems
  • Church’s Thesis
  • Complexity Theory, P and NP


Additional information

Product Name

Theory of Computation Hand Note

Product Size

17.8 MB


File Format

File Category


Need For

College, Competition, Exams, GATE, IES, PSU, Semester, University

Product Type

Created By

Siddharth Vairagi (NIT Agartala)

Uploaded By

Aravind Gupta




There are no reviews yet.

Be the first to review “Theory of Computation Hand Note”

Your email address will not be published. Required fields are marked *

No more offers for this product!