51:17duration 51 minutes 17 seconds
Lec 21, May 20.mp4
52:55duration 52 minutes 55 seconds
Lecture 4, Apr 8.mp4
01:03:04duration 1 hour 3 minutes
Lecture 3, Apr 5.mp4
07:19duration 7 minutes 19 seconds
ECS 120 5a:5 corollary of Myhill-Nerode Theorem…
ECS 120 5a:5 corollary of Myhill-Nerode Theorem we use and its proof
04:16duration 4 minutes 16 seconds
ECS 120 5a:2 definition of separating extension…
ECS 120 5a:2 definition of separating extension and L-equivalence
52:59duration 52 minutes 59 seconds
mat133-2021-04-30-conditional-expectation--discoun…
mat133-2021-04-30-conditional-expectation--discounted-processes
Conditional expectation. Discounted processes.…
04:57duration 4 minutes 57 seconds
ECS 220 6c:7.2-1 arithmetical hierarchy
09:43duration 9 minutes 43 seconds
ECS 220 4a:6.1-2 observations about the…
ECS 220 4a:6.1-2 observations about the polynomial hierarchy and the great collapse
11:56duration 11 minutes 56 seconds
ECS 220 4a:6.1-1 the polynomial hierarchy
08:09duration 8 minutes 9 seconds
ECS 120 5c:3 formal definition of TM syntax
08:18duration 8 minutes 18 seconds
ECS 120 4c:1 NFAs can simulate regex_s proof
06:39duration 6 minutes 39 seconds
ECS 120 4b:3 NFAs can simulate RRGs proof
07:17duration 7 minutes 17 seconds
ECS 120 4a:1 introduction to computational…
ECS 120 4a:1 introduction to computational equivalence, NFAs can simulate DFAs
04:19duration 4 minutes 19 seconds
ECS 120 3c:3 NFA concatenation proof
09:24duration 9 minutes 24 seconds
ECS 120 3a:4 DFA union proof
06:31duration 6 minutes 31 seconds
ECS 120 2c:5 formal definition of NFA semantics