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
08:18 duration 8 minutes 18 seconds
ECS 120 4c:1 NFAs can simulate regex_s proof
06:39 duration 6 minutes 39 seconds
ECS 120 4b:3 NFAs can simulate RRGs proof
04:49 duration 4 minutes 49 seconds
ECS 120 4b:4 right-regular versus left-regular…
ECS 120 4b:4 right-regular versus left-regular grammars
07:11 duration 7 minutes 11 seconds
ECS 120 4b:1 RRGs can simulate DFAs example
07:43 duration 7 minutes 43 seconds
ECS 120 4a:3 proof DFAs can simulate NFAs with no…
ECS 120 4a:3 proof DFAs can simulate NFAs with no 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
08:20 duration 8 minutes 20 seconds
ECS 120 3c:1 NFA Kleene star example
06:02 duration 6 minutes 2 seconds
ECS 120 3b:4 NFA concatenation example