Automata theory, Formal Languages, and Computation

  • Theory of computation course content (4cs4-6)  pdf
  • Course Objectives   html
  • Finite automata   pdf
  • Regular Expressions   pdf
  • Nondeterministic Finite Automata   pdf
  • Equivalence of NFA and DFA   pdf
  • Mealy and Moore Machines   pdf
  • On Closure properties of Regular Languages  pdf
  • On Closure properties of Regular Languages  pdf
  • On Closure properties, Regex to NFA, DFA to regex  pdf
  • Pumping Lemma for regular languages  pdf
  • Minimization of Finite automata  pdf
  • Myhill-Nerode Theorem and its Applications  pdf
  • Introduction to Context-free languages and Grammars   pdf
  • On Closure properties, and ambiguity in Context-free languages   pdf
  • Pumping Lemma for Context-free languages   pdf
  • Normal Forms of Context-free Grammars   pdf
  • Chomsky Normal Forms, and Greibach Normal Forms   pdf
  • Decision and decidable properties of context-free Languages   pdf
  • Turing machine and Computation   pdf
  • Turing machine as Language recognizer   pdf
  • Multi-tape Turing machines   pdf
  • Universal Turing machine   pdf
  • Chomsky Hierarchy Grammars   pdf
  • Recursive and Recursively Enumerable Languages   pdf
  • Undecidability   pdf
  • Computational Complexity concepts pdf
  • Computational Complexity(NP, NP-Complete, NP-hard) pdf