Basic Tree Terminologies and Representation in the Memory | Types of Trees in Discrete Mathematics
16:08
Binary Tree Creation and its Types | Types of Binary Trees in Discrete Mathematics
15:29
Equivalence & Minimization of Finite Automata | Equivalence of NFA and DFA in Theory of Computation
17:22
Two Way FA, Applications, and Limitations of Finite Automata | Two-way Finite Automata- 2DFA in TOC
10:42
Binary Search Trees | Creation of BST - Binary Search Trees in Discrete Mathematics
13:49
Laws of Logics | Idempotent, Associative, Commutative, Distributive, Implication Laws in Discrete
13:30
Theory of Inference and Natural Deduction | Law of Detachment/Modus Ponen in Discrete Mathematics
11:27
Conversion from Finite Automata to Regular Expression | Algebraic Law using Arden's Theorem in TOC
16:03