07:19
ECS 120 5a:5 corollary of Myhill-Nerode Theorem…
ECS 120 5a:5 corollary of Myhill-Nerode Theorem we use and its proof
03:53
ECS 120 5a:4 statement of Myhill-Nerode Theorem
11:34
ECS 120 6a:1 languages decided-recognized by TMs
14:55
ECS 120 5c:4 formal definition of TM semantics
errata: At 4:38, I incorrectly said and wrote that L,R,S correspond to +1, -1, and 0. They correspond to -1, +1, and 0, i.e., moving left (L) decrements (-1) the tape head position, and moving right…
07:43
ECS 120 5b:2 pumping lemma proof that 0n1n is not…
ECS 120 5b:2 pumping lemma proof that 0n1n is not regular
05:30
ECS 120 5b:1 pumping lemma for regular languages
06:58
ECS 120 5a:4 direct proof that uu is not regular
03:34
ECS 120 5a:3 picture of previous proof
17:39
ECS 120 5a:2 direct proof that equal zero-one is…
ECS 120 5a:2 direct proof that equal zero-one is not regular
08:16
ECS 120 5a:1 why we need rigor to argue that a…
ECS 120 5a:1 why we need rigor to argue that a language is not regular
06:39
ECS 120 4b:3 NFAs can simulate RRGs proof
04:49
ECS 120 4b:4 right-regular versus left-regular…
ECS 120 4b:4 right-regular versus left-regular grammars
05:16
ECS 120 4b:2 RRGs can simulate DFAs proof
07:11
ECS 120 4b:1 RRGs can simulate DFAs example
04:40
ECS 120 4a:5 alternative choices in subset…
ECS 120 4a:5 alternative choices in subset construction
ECS 120 4a:3 proof DFAs can simulate NFAs with no…
ECS 120 4a:3 proof DFAs can simulate NFAs with no epsilon-transitions
AggieVideo video portal by Academic Technology ServicesUC Davis | Information and Educational Technology | User Guides and Technical Documentation