NEW SLIDES FOR 2017/2018

• Lecture 1: Introduction (Administrative info, Overview of the course, Some basic notation)
• Lecture 2: DFA
• Lecture 3: NFA and ε-NFA. Conversion to DFA.
• Lecture 4: Regular expressions (Closure properties for regular expressions, Regular expressions, Conversion of regular expression to NFA, Conversion of DFA to regular expressions using the GNFA method).
• Lecture 5: DFA Minimization
  Alternative method for converting DFA to regular expressions (Old slides)
• Lecture 6: Pumping lemma, Homomorphisms, Myhill-Nerodes theorem
• Lecture 14: Turing machines and undecidability
• Lecture 15: Undecidability and reductions