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

0:08:33

Theory of Computation: Planar Turing Machines

0:08:20

Theory of Computation: Planar Nondeterministic Finite Automata

0:03:25

Theory of Computation: Planar Pushdown Automata

0:53:07

Theory of Computation Lecture: Chomsky Normal Form

0:49:25

Theory of Computation Lecture: Deterministic Context-Free Languages (DCFL)

0:37:03

Theory of Computation Lecture: Clique and 3SAT

0:26:55

Theory of Computation Lecture: Final Exam Review

0:43:29

Theory of Computation Lecture: NP-Completeness and CNF-SAT

1:02:27

Theory of Computation Lecture: NFA to DFA (Powerset Construction)

0:54:38

Theory of Computation Problem Session: DFAs and NFAs

1:01:14

Theory of Computation Lecture: Product Construction Example + NFAs

0:04:17

Theory of Computation: DFA for an even number of 0s, or exactly two 1s

0:01:53

Theory of Computation: DFAs for Emptyset and Not Epsilon

0:02:57

Theory of Computation: DFA for Binary Strings where every odd position is 1

0:03:06

Theory of Computation: DFA for Binary Strings except 11 and 111

0:05:16

Theory of Computation: DFA for Strings with at least two 0s and at most one 1

0:01:43

Theory of Computation: DFA for Binary Strings that are Empty or 0

0:02:03

Theory of Computation: DFA for Binary Strings of Length at most 5

0:04:11

Theory of Computation: DFA for Binary Strings not containing 110

0:04:10

Theory of Computation: DFA for Starts with 0 and Odd Length, or 1 and Even Length

0:02:33

Theory of Computation: DFA for Binary Strings with third symbol 0

0:03:59

Theory of Computation: DFA for Binary Strings containing 0101

0:02:03

Theory of Computation: DFA for Binary Strings with at least three 1s

0:02:56

Theory of Computation: DFA for Binary Strings that begin with a 1 and end with a 0