Все публикации

Lecture 11 -1:21:40

Lecture 11 - Proving languages are not regular

Lecture 23 -0:08:16

Lecture 23 - Clarification on the notation of P(L(M))

Lecture 23 -1:20:04

Lecture 23 - Rice's Theorem

Lecture 22 -1:21:30

Lecture 22 - Undecidability hierarchy

Lecture 14 -1:23:27

Lecture 14 - CFL Proof by Induction and Closure Properties

Lecture 13 -1:21:54

Lecture 13 - Intro to CFLs

Lecture 4 -1:20:34

Lecture 4 - Minimal DFAs and NFAs

Lecture 24 -0:07:17

Lecture 24 - Part 8

Lecture 7 -0:11:22

Lecture 7 - Part 6

Lecture 24 -0:19:05

Lecture 24 - Part 4

Lecture 24 -0:16:10

Lecture 24 - Part 9

Lecture 9 -1:23:31

Lecture 9 - Myhill-Nerode Theorem

Lecture 17 -1:22:09

Lecture 17 - Pumping Lemma for CFLs

Lecture 20 -1:24:35

Lecture 20 - Intro to reductions

Lecture 21 -1:19:34

Lecture 21 - More mapping reduction exercises!

Lecture 6 -1:21:38

Lecture 6 - Closure Properties Reg Languages

Lecture 2 -1:20:36

Lecture 2 - Formal Language Theory

Lecture 24 -0:08:23

Lecture 24 - Part 3

Lecture 24 -0:08:14

Lecture 24 - Part 7

Lecture 5 -1:20:29

Lecture 5 - NFAs=DFAs, NFA+Epsilon

Lecture 3 -1:24:54

Lecture 3 - DFAs

Lecture 24 -0:24:44

Lecture 24 - Part 5

Lecture 24 -0:17:44

Lecture 24 - Part 2

Lecture 24 -0:42:09

Lecture 24 - Part 6