01:09:41 duration 1 hour 9 minutes
PHYEPS30 Lecture 15 (Second Part)
Lecture 15 (Second Part)
01:11:14 duration 1 hour 11 minutes
Lecture 13 (Second Part) Lecture 15 (First Part)
13:26 duration 13 minutes 26 seconds
ECS 120 5c:2 example TM
12:19 duration 12 minutes 19 seconds
ECS 120 4c:5 regex_s can simulate NFAs
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
06:39 duration 6 minutes 39 seconds
ECS 120 4b:3 NFAs can simulate RRGs proof
07:11 duration 7 minutes 11 seconds
ECS 120 4b:1 RRGs can simulate DFAs example
04:40 duration 4 minutes 40 seconds
ECS 120 4a:5 alternative choices in subset…
ECS 120 4a:5 alternative choices in subset construction
06:50 duration 6 minutes 50 seconds
ECS 120 4a:4 handling epsilon-transitions
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)
07:17 duration 7 minutes 17 seconds
ECS 120 4a:1 introduction to computational…
ECS 120 4a:1 introduction to computational equivalence, NFAs can simulate DFAs
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
05:34 duration 5 minutes 34 seconds
ECS 120 3b:3 NFA union example