04:54
TM as a Transducer part 2
05:26
TM as Transducer part 1
09:15
POST CORRESPONDENCE Problem
02:47
Turing Thesis
01:37
Non Halting Turing Machine
04:27
Halting Turing Machine
05:07
Modification of Standard TM 1
19:27
TURING MACHINE EXAMPLE 2
18:02
TURING MACHINE EXAMPLE 1
03:59
Turing Machine
03:41
Decision Properties for CFL
10:56
Pumping Lemma for CFL
07:52
Pumping Lemma for Regular Languages
05:48
Equality Problem is Decidable
06:59
Ambiguous Grammar
20:34
Regular & Non regular Grammar Part 1
X
About
Tags