07:38
Introduction to Undecidabilty
05:32
Halting Problem
15:41
Conversion FA TO RE
03:57
PCP part 2
15:02
PCP problem
19:58
NFA TO DFA CONVERSION
11:38
Regular expression to NFA
11:03
Turing machine example addition of two numbers
17:31
Turing machine subtraction for two numbers
08:24
Turing machine 1's complement
08:20
Turing machine 2's complement
16:26
Turing machine example
10:38
PDA EXAMPLE a^2nb^3n
15:02
DFA and NFA
15:02
Automata terminology
05:48
AUTOMATA BASIC
15:02
Minimization of DFA
12:59
PDA examples
09:15
PDA example3 continue
15:02
PDA example 3
09:43
PDA example2
13:52
PDA example part 2
15:02
PDA example part 1
09:56
PDA Part 2
15:02
PDA Part 1
02:41
Simplification of CFG part II
15:02
Simplification of CFG part 1
X
About
Tags