Все публикации

0:25:31

Sorting Techniques

0:33:53

Topological Sorting and Shortest Path Algorithm

0:32:19

Equivalence of PDA and CFG

0:39:34

Pushdown Automata

0:34:24

Graph, Terminologies and Traversal

0:56:00

Greibach Normal Form GNF

0:40:52

Chomsky Normal Form - CNF

0:23:45

B Tree

0:30:39

Removal of Unit Production from CFG

0:46:54

Reduction of CFG

0:24:39

Splay Tree

0:51:09

Parse Tree & Ambiguous Grammar

0:56:50

Context Free Grammar, Derivation Types

0:26:27

AVL Tree - Deletion Part 2

0:44:40

AVL Tree - Insertion

0:39:23

Introduction to Grammar, Types of Grammar

0:19:10

Pumping Lemma for RE

0:30:13

Conversion of FA to RE using State Elimination Method

0:25:33

Minimization of DFA

0:18:31

Binary Search Tree

0:30:24

Conversion of FA to Regular Expression using Ardens Theorem

0:26:16

Binary Tree Representation Expression

0:33:40

Tree Terminologies Representation and Traversal

0:29:44

Conversion of FA to Regular Expression using Kleens Theorem