|
Module 1 - Regular Languages & Finite Automata
|
|
|
|
Lecture 1 - ALL Basic Concepts of TOC
199:00
|
|
|
|
Annotated Notes - Lecture 1 - TOC Basics Complete Summary
(198 pages)
|
|
|
|
Homework in Lecture 1 - Video Solution
|
|
|
|
Lecture 2A - Finite Automata & DFA
193:00
|
|
|
|
Annotated Notes - Lecture 2A - Finite Automata & DFA
(191 pages)
|
|
|
|
Lecture 2B - DFA Design Part 2
|
|
|
|
Annotated Notes - Lecture 2B - DFA Design Part 2
(78 pages)
|
|
|
|
DFA - ALL GATE PYQs
|
|
|
|
Lecture 2C - Product Automata & Extended Transition Function
|
|
|
|
Annotated Notes - Lecture 2C - Product Automata & Extended Transition Function
(78 pages)
|
|
|
|
Lecture 2D - Minimization of DFA, Minimal DFA
166:00
|
|
|
|
Annotated Notes - Lecture 2D - Minimization of DFA, Minimal DFA
(134 pages)
|
|
|
|
Minimal DFA - All GATE PYQs
|
|
|
|
Lecture 3 - NFA - Nondeterministic Finite Automata
|
|
|
|
Annotated Notes - Lecture 3 - NFA - Nondeterministic Finite Automata
(165 pages)
|
|
|
|
Lecture 4 - Equivalence of DFAs and NFAs - NFA to DFA Conversion
|
|
|
|
Annotated Notes - Lecture 4 - Equivalence of DFAs and NFAs
(132 pages)
|
|
|
|
Lecture 5 - Regular Expressions
177:00
|
|
|
|
Practice Question - Regular Expressions
21:00
|
|
|
|
Annotated Notes - Lecture 5 - Regular Expressions
(162 pages)
|
|
|
|
Regular Expressions - ALL GATE PYQs
|
|
|
|
Regular Expressions - ALL GATE PYQs - Part 2
|
|
|
|
Lecture 5B - Finite Automata to Regular Expression Conversion
167:00
|
|
|
|
Annotated Notes - Lecture 5B - Finite Automata to Regular Expression Conversion
(142 pages)
|
|
|
|
Lecture 6A - Non-Regular Languages
191:00
|
|
|
|
Annotated Notes of Lecture 6A
|
|
|
|
Lecture 6B - Non-Regular Languages & GATE PYQs
|
|
|
|
Annotated Notes - Lecture 6B - Non-Regular Languages & GATE PYQs
(151 pages)
|
|
|
Module 2 - Context Free Languages, Grammars, Pushdown Automata
|
|
|
|
Lecture 1 - Context Free Grammar CFG
|
|
|
|
Annotated Notes - Lecture 1 - Context Free Grammar CFG
(141 pages)
|
|
|
|
Lecture 2 - Regular Grammars
109:00
|
|
|
|
Annotated Notes - Lecture 2 - Regular Grammars
(115 pages)
|
|
|
|
Context Free Grammars - ALL GATE PYQs
|
|
|
|
Lecture 3 - Ambiguity of CFGs
|
|
|
|
Annotated Notes - Lecture 3 - Ambiguity of CFGs
(123 pages)
|
|
|
|
Lecture 4 - Simplification of Context Free Grammar
141:00
|
|
|
|
Annotated Notes - Lecture 4 - Simplification of Context Free Grammar
(143 pages)
|
|
|
|
Lecture 5 - Normal Forms of CFGs - CNF & GNF
|
|
|
|
Annotated Notes - Lecture 5 - Normal Forms of CFGs - CNF & GNF
(120 pages)
|
|
|
|
Lecture 6A - Pushdown Automata - PDA
|
|
|
|
Annotated Notes - Lecture 6A - Pushdown Automata - PDA
(165 pages)
|
|
|
|
Lecture 6B - PDA with Empty Stack Acceptance
|
|
|
|
Annotated Notes - Lecture 6B - PDA with Empty Stack Acceptance
(34 pages)
|
|
|
|
PDA - ALL GATE PYQs - Part 1
|
|
|
|
Lecture 7 - DPDA & DCFL
135:00
|
|
|
|
Annotated Notes - Lecture 7 - DPDA & DCFL
(118 pages)
|
|
|
|
Lecture 8A - Identification of DCFLs
125:00
|
|
|
|
Annotated Notes - Lecture 8A - Identification of DCFLs
(102 pages)
|
|
|
|
Lecture 8B - Identification of CFLs
213:00
|
|
|
|
Annotated Notes - Lecture 8B - Identification of CFLs
(148 pages)
|
|
|
|
CFLs, DCFLs Identification - ALL GATE PYQs - Part 1
|
|
|
Module 3 - Closure Properties
|
|
|
|
Lecture 1 - Context Sensitive Languages CSL
|
|
|
|
Annotated Notes - Lecture 1 - Context Sensitive Languages CSL
(20 pages)
|
|
|
|
Lecture 2 - Chomsky Hierarchy - Language Hierarchy
|
|
|
|
Annotated Notes - Lecture 2 - Chomsky Hierarchy - Language Hierarchy
(26 pages)
|
|
|
|
CFLs, DCFLs Identification - ALL GATE PYQs - Part 2
|
|
|
|
Lecture 3A - Closure Properties of Regular, CFLs, DCFLs
171:00
|
|
|
|
Annotated Notes - Lecture 3A - Closure Properties of Regular, CFLs, DCFLs
(216 pages)
|
|
|
|
Lecture 3B - Closure Properties of RE, Recursive Languages
134:00
|
|
|
|
Annotated Notes - Lecture 3B - Closure Properties of RE, Recursive Languages
(188 pages)
|
|
|
|
Lecture 3C - Closure Properties of Nonregular, Undecidable Languages
|
|
|
|
Annotated Notes - Lecture 3C - Closure Properties of Nonregular, Undecidable Languages
(79 pages)
|
|
|
|
Closure Properties - MANY Practice Questions
|
|
|
Module 4 - Turing Machines, Decidability
|
|
|
|
Lecture 1A - Turing Machine - Definition, Concept
70:00
|
|
|
|
Annotated Notes - Lecture 1A - Turing Machine - Definition, Concept
(79 pages)
|
|
|
|
About Lecture 1B
|
|
|
|
Lecture 1B - Turing Machines - Revision & Practice
164:00
|
|
|
|
Annotated Notes of Lecture 1B
|
|
|
|
Lecture 2 - Understanding Behavior of TM
25:00
|
|
|
|
Lecture 3 - Decider, Decidable Languages
20:00
|
|
|
|
Lecture 4A - Decidability of RE Languages - Rice Theorem
233:00
|
|
|
|
Annotated Notes - Lecture 4A - Decidability of RE Languages - Rice Theorem
(197 pages)
|
|
|
|
Lecture 4B - Decidability - ALL Step Based GATE PYQs of TM
131:00
|
|
|
|
Annotated Notes - Lecture 4B - Decidability - ALL Step Based GATE PYQs of TM
(94 pages)
|
|
