Theory Of Computation (TOC)
UNIT - I Basic Mathematical Objects, Languages, Recursive Definitions & Finite Automata
-
Session 1 : Introduction To Sets (67:56)
-
Session2 : Set Operations (50:49)
-
Session 3 : Postulates or Laws on Sets (61:12)
-
Session 4 : Symmetric Difference, Relations (62:47)
-
Session 5 : Relations (62:46)
-
Session 6 : Examples on Relations (48:15)
-
Session 7 : Functions (55:46)
-
Session 8 : Logic (58:12)
-
Session 9 : Language Fundamentals (56:41)
-
Session 10 : DFA Representation, Language accentance (56:30)
-
Session 11 : Drawing DFA for given Language (69:28)
-
Session 12 : Answer writting mechanism for Exam (65:05)
-
Session 13 : Equivalence of DFA (70:54)
-
Session 14 : Union, Intersection and Minus (59:22)
-
Session 15 : Minimization of DFA (62:42)
-
Session 16 : Drawing NFA (60:31)
-
Session 17 : Conversion NFA To DFA (66:18)
-
Session 18 : NFA with Epsilon (47:38)
-
Session 19 - E(Epsilon) -NFA To DFA (66:02)
-
Session 20 - MealyAndMooreMachine (69:39)
Unit II - Regular Expressions and Languages
Unit III - Context Free Grammars (CFG) and Languages
-
Session 26 - CFG (57:46)
-
Session 27 - Language To CFG (59:16)
-
Session 28 - RE To CFG (69:53)
-
Session 29 - Language To CFG Examples (66:44)
-
Session 30 - Simplification of CFG - Remove Epsilon, Unit Productions (62:57)
-
Session 31 - SimplifyCFG - Non GeneratingSymbols,Non Reachable Symbols (61:45)
-
Session 32 - CNF (67:07)
-
Session 33 - CFG To GNF Conversion (56:02)
-
Session 34 - GNF (70:32)
UNIT - IV : Push Down Automata
UNIT - V Turing machines
Unit VI: Recursively enumerable languages
0 comments