regular languages: videos

Pick anything below and it plays in the bar at the foot of the window — and keeps playing while you go on browsing the directory.

1. 1▶Lecture 14/65: Context Free Grammar ExampleTheory of ComputationNotes
   +Watch later
2. 2▶Lecture 15/65: Kinds of Context Free LanguagesTheory of ComputationNotes
   +Watch later
3. 3▶Lecture 13/65: Intro to Context Free Grammars and LanguagesTheory of ComputationNotes
   +Watch later
4. 4▶Lecture 3/65: Finite State Machines: ExamplesTheory of ComputationNotes
   +Watch later
5. 5▶Lecture 4/65: Operations on Regular LanguagesTheory of ComputationNotes
   +Watch later
6. 6▶Lecture 5/65: Nondeterministic Finite State Machines: IntroductionTheory of ComputationNotes
   +Watch later
7. 7▶Lecture 6/65: Nondeterministic Finite State Machines: Formal DefinitionTheory of ComputationNotes
   +Watch later
8. 8▶Lecture 7/65: Equivalence of Deterministic and Nondeterministic FSMsTheory of ComputationNotes
   +Watch later
9. 9▶Lecture 8/65: Closure of Regular OperationsTheory of ComputationNotes
   +Watch later
10. 10▶Lecture 9/65: Regular ExpressionsTheory of ComputationNotes
    +Watch later
11. 11▶L16: Unrecognizable Languages and ReductionsTheory of Computation - Fall 2011 (Course)Notes
    +Watch later
12. 12▶L15: Proof by Diagonalization that ATM (Halting Problem) is Not DecidableTheory of Computation - Fall 2011 (Course)Notes
    +Watch later
13. 13▶L13: Diagonalization, Countability and UncountabilityTheory of Computation - Fall 2011 (Course)Notes
    +Watch later
14. 14▶L12: Universal Turing Machines; The Halting Problem is Recognizable but Not DecidableTheory of Computation - Fall 2011 (Course)Notes
    +Watch later
15. 15▶L11: Church-Turing Thesis and Examples of Decidable LanguagesTheory of Computation - Fall 2011 (Course)Notes
    +Watch later
16. 16▶L14: More Diagonalization; Proof that Turing Machines are CountableTheory of Computation - Fall 2011 (Course)Notes
    +Watch later
17. 17▶L10: Equivalence of Non-Deterministic and Deterministic TMsTheory of Computation - Fall 2011 (Course)Notes
    +Watch later
18. 18▶L8: Introduction to Turing Machines and ComputationsTheory of Computation - Fall 2011 (Course)Notes
    +Watch later
19. 19▶L9: More TM Design and Introduction to Non-Determinstic TMsTheory of Computation - Fall 2011 (Course)Notes
    +Watch later
20. 20▶L6: The Pumping Lemma and Introduction to CFLsTheory of Computation - Fall 2011 (Course)Notes
    +Watch later