CECS 329 Recordings of Lectures

• Friday, November 6th, Church-Turing Thesis, Intro to Decidability, Decidability of DFA and CFG Problems
• Wednesday, November 4th, Decidability of CFG Problems
• Monday, November 2nd, Church-Turing Thesis, Intro to Decidability, and Decidability of DFA Problems
• Monday, October 26th, More on Designing TM's via State Diagrams
• Friday, October 23rd, Turing Machine Computations and Designing TM's via State Diagrams
• Wednesday, October 21st, Turing Machine Computations and Designing TM State Diagrams
• Monday, October 19th, How NPDA's recognize CFL's, Introduction to Turing Machines
• Friday, October 16th, Context Free Languages: CFG's and their design, Derivations, Derivation Parse Trees, Ambiguity
• Wednesday, October 14th, More on Context Free Languages: Derivation Parse Trees, Ambiguity, and Designing CFG's
• Monday, October 12th, Context Free Languages: Context Free Grammars and Languages, Examples, and Derivations
• Monday, October 5th, Converting and NFA N to a Regular Expression that Describes L(N)
• Wednesday, September 30th, Regular Expressions Describe Regular Languages and Regular Languages can be described by Regular Expressions
• Wednesday, September 30th, Regular Expressions Describe Regular Languages
• Monday, September 28th, More Regular Expressions
• Saturday, September 26th, More on Regular Expressions
• Wednesday, September 23rd, Introduction to Regular Expressions
• Monday, September 21st, Language Operations
• Monday, September 14th, Highlights: NFA to DFA Example, DFA Design Example
• Friday, September 11th, Nondeterministic Finite Automata
• Wednesday, September 9th, Nondeterministic Finite Automata
• DFA Lecture: Examples 3.4 and 3.5
• Friday, September 4th
• Wednesday, September 2nd
• Monday, August 31st
• Friday, August 28th