01:18:37 duration 1 hour 18 minutes
ECS20 - W22 - Lecture 1 (1T): Intro
Online lecture (Zoom recording) of 1/4/2022. Course basics. Two example problems: (1) counting the number of paths from the VMC to Pachamama coffee shop; and (2) five riffle shuffles is inadequate…
07:21 duration 7 minutes 21 seconds
ECS 220 9a:2-8.5 Geography game
08:09 duration 8 minutes 9 seconds
ECS 120 5c:3 formal definition of TM syntax
12:19 duration 12 minutes 19 seconds
ECS 120 4c:5 regex_s can simulate NFAs
02:08 duration 2 minutes 8 seconds
ECS 120 4c:4 expression automata
06:41 duration 6 minutes 41 seconds
ECS 120 4c:3 NFAs with isolated start and accept…
ECS 120 4c:3 NFAs with isolated start and accept state
07:03 duration 7 minutes 3 seconds
ECS 120 4c:2 NFAs can simulate regex_s example
06:39 duration 6 minutes 39 seconds
ECS 120 4b:3 NFAs can simulate RRGs proof
05:16 duration 5 minutes 16 seconds
ECS 120 4b:2 RRGs can simulate DFAs proof
04:40 duration 4 minutes 40 seconds
ECS 120 4a:5 alternative choices in subset…
ECS 120 4a:5 alternative choices in subset construction
14:44 duration 14 minutes 44 seconds
ECS 120 4a:2 example of DFA simulating NFA…
ECS 120 4a:2 example of DFA simulating NFA (subset construction)
05:13 duration 5 minutes 13 seconds
ECS 120 3c:4 NFA Kleene star proof
04:19 duration 4 minutes 19 seconds
ECS 120 3c:3 NFA concatenation proof
07:14 duration 7 minutes 14 seconds
ECS 120 3c:2 NFA union proof
08:20 duration 8 minutes 20 seconds
ECS 120 3c:1 NFA Kleene star example
05:34 duration 5 minutes 34 seconds
ECS 120 3b:3 NFA union example