'NFA <=> DFA' Video Lecture

NFA <=> DFA

  • Course: Formal Languages and Automata Theory
  • Discipline: Mathematics
  • Faculty: Dr. K.V. Krishna, Dr. Diganta Goswami
  • Institute: IIT Guwahati

    • NEXT LECTURE >> Myhill-Nerode Theorem
    Download this video in MP4, FLV & 3GP formats
    Format  Size  Download
    MP4 261 MB MP4 Video Download Link 1
    MP4 261 MB MP4 Video Download Link 2
    FLV 140 MB FLV Video Download Link 1
    FLV 140 MB FLV Video Download Link 2
    3gp 69 MB 3gp Video Download Link 1
    3gp 69 MB 3gp Video Download Link 2
    Search Courses
    Course Video Lectures Introduction Alphabet, Strings, Languages Finite Representation Grammars (CFG) Derivation Trees Regular Grammars Finite Automata Nondeterministic Finite Automata NFA <=> DFA Myhill-Nerode Theorem Minimization RE => FA FA => RE FA <=> RG Variants of FA Closure Properties of RL Homomorphism Pumping Lemma Simplification of CFG Normal Forms of CFG Properties of CFLs Pushdown Automata PDA <=> CFG Turing Machines Turing Computable Functions Combining Turing Machines Multi Input Turing Decidable Languages Varients of Turing Machines Structured Grammars Decidability Undecidability1 Undecidability2 Undecidability3 Time Bounded Turing Machines P and NP NP-Completeness NP-Complete Problems1 NP-Complete Problems2 NP-Complete Problems3 Chomsky Hierarchy
    2015. EngineeringVideoLectures.com