Math 2.0

Resources / course

Formal Languages and Automata Theory CHC04M6V8C

URIm2://res/CHC04M6V8C
Kindcourse
CreatorsDiganta Goswami (instructor), K.V. Krishna (instructor)
Date2014-11-25
Scopein
Idscourse 0022nd079:111103016

Expressions

e1: edition

Languageen
Date2014-11-25
Contents
  • part 1: Languages and Finite Representation
  • session 1: Introduction
  • session 2: Alphabet, Strings, Languages
  • session 3: Finite Representation
  • part 2: Grammars
  • session 4: Grammars (CFG)
  • session 5: Derivation Trees
  • session 6: Regular Grammars
  • part 3: Finite Automata
  • session 7: Finite Automata
  • session 8: Nondeterministic Finite Automata
  • session 9: NFA DFA
  • part 4: Minimization of Finite Automata
  • session 10: Myhill-Nerode Theorem
  • session 11: Minimization
  • part 5: RL ? RG ? FA
  • session 12: RE => FA
  • session 13: FA => RE
  • session 14: FA RG
  • part 6: Variants of Finite Automata
  • session 15: Variants of FA
  • part 7: Properties of Regular Languages
  • session 16: Closure Properties of RL
  • session 17: Homomorphism
  • session 18: Pumping Lemma
  • part 8: Simplification of CFGs
  • session 19: Simplification of CFG
  • session 20: Normal Forms of CFG
  • part 9: Properties of CFLs
  • session 21: Properties of CFLs
  • part 10: Pushdown Automata
  • session 22: Pushdown Automata
  • session 23: PDA CFG
  • part 11: Turing Machines
  • session 24: Turing Machines
  • session 25: Turing Computable Functions
  • session 26: Combining Turing Machines
  • session 27: Multi Input
  • session 28: Turing Decidable Languages
  • session 29: Varients of Turing Machines
  • part 12: Structured Grammars
  • session 30: Structured Grammars
  • part 13: Decidability and Undecidability
  • session 31: Decidability
  • session 32: Undecidability1
  • session 33: Undecidability2
  • session 34: Undecidability3
  • part 14: Introduction to Complexity Theory
  • session 35: Time Bounded Turing Machines
  • session 36: P and NP
  • session 37: NP-Completeness
  • session 38: NP-Complete Problems1
  • session 39: NP-Complete Problems2
  • session 40: NP-Complete Problems3
  • part 15: Chomsky Hierarchy
  • session 41: Chomsky Hierarchy

Catalogue records