[syllabus] | [lecture notes] | [HW1-6,Q1] | [HW7-10,Q2,F] | [project]

[simulators/parsers] | [language definitions] | [automata definitions] | [computable definitions]

CS451 Selected Lecture Notes

Note that this file is plain text and .gif files. The plain text spells out Greek letters because they can not be typed. 

 These are not intended to be complete lecture notes.
 Complicated figures or tables or formulas are included here
 in case they were not clear or not copied correctly in class.

 Information from the  language definitions, automata definitions,
  computability definitions and  class definitions is not duplicated here. 

 Lecture numbers correspond to the syllabus numbering.

Contents

  • Lecture 1 Fast Summary Part 1
  • Lecture 2 Fast Summary Part 2
  • Lecture 3 DFA and regular expressions
  • Lecture 4 Nondeterministic Finite Automata NFA
  • Lecture 5 NFA with epsilon moves
  • Lecture 6 regular expression to NFA
  • Lecture 7 NFA to regular expression, Moore, Mealy
  • Lecture 8 Pumping Lemma for regular languages
  • Lecture 9 Intersection of two languages, closure
  • Lecture 10 Decision Algorithms
  • Lecture 11 Quiz 1
  • Lecture 12 Myhill-Nerode minimization
  • Lecture 13 Formal Grammars, CFG
  • Lecture 14 Context Free Grammar derivation trees
  • Lecture 15 CFG 'simplification' algorithm
  • Lecture 16 Chomsky Normal Form
  • Lecture 17 Greibach Normal Form
  • Lecture 18 Inherently ambiguous CFL's, Project
  • Lecture 19 Quiz 2
  • Lecture 20 Push Down Automata
  • Lecture 21 CFL to PDA
  • Lecture 22 NPDA to CFL
  • Lecture 23 CYK algorithm for CFG's
  • Lecture 24 Pumping Lemma for Context Free Languages
  • Lecture 25 CFL closure properties
  • Lecture 26 Turing Machine Model
  • Lecture 27 The Halting Problem
  • Lecture 28 Church Turing Thesis
  • Lecture 29 Review
  • Lecture 30 Final Exam

    • Last updated 2/5/01

    Other links

    Go to top