-
10.1 – Introduction of TOC
26:52
-
10.2 – Regular Language, Grammar, Expression
01:05:14
-
10.3 – Finite State Automata
01:05:14
-
10.4 – Minimization of DFA
31:34
-
10.5 – Conversion Between FSA-RE-RG
58:24
-
10.6 – NFA-ε to DFA Conversion
16:42
-
10.7 – Properties of Regular Language
01:18:33
-
10.8 – Context Free Grammar
59:03
-
10.9 – Simplification of CFG
22:33
-
10.10 – CFL to PDA
01:00:37
-
10.11 – NPDA & DPDA
24:11
-
10.12 – CFL or Not
13:50
-
10.13 – CFG to PDA
25:38
-
10.14 – Closure Properties of CFL
39:01
-
10.15 – Unrestricted Grammar (Type-0)
16:42
-
10.16 – Turing Machine
39:06
-
10.17 – Turing Machine as a Transducer
16:30
-
10.18 – RL, REL & Closure Property
00:00
-
10.19 – Decidability & Countability
00:00