01:19:59duration 1 hour 19 minutes
Dynamic programming: Fibonacci, text segmentation…
Dynamic programming: Fibonacci, text segmentation again
Class recording
Backtracking: n queens, game trees, text…
Backtracking: n queens, game trees, text segmentation
Divide and conquer: selection, multiplication
Recursion: Hanoi, mergesort, quicksort
Midterm 1 Practice 1
Turing machines
Context-free languages and grammars
Language transformations
NFAs: ε-transitions, equivalence with…
NFAs: ε-transitions, equivalence with DFAs and regular expressions
Proving nonregularity via fooling sets; NFAs:…
Proving nonregularity via fooling sets; NFAs: intuition and examples
Sep 04: DFAs: product construction, closure,…
Sep 04: DFAs: product construction, closure, automatic=regular
Sep 02: DFAs: intuition, definitions, examples
Aug 28: Regular languages and regular expressions
Aug 26: Administrivia, Strings, and Induction
Administrivia and course goals Recursive…