REMOVAL OF UNIT PRODUCTIONS - SIMPLIFICATION OF CFG IN AUTOMATA THEORY || TOC
30:42
CHOMSKY NORMAL FORM (CNF) & CONVERSION OF CFG TO CNF IN AUTOMATA THEORY || CFG TO CNF || TOC
10:28
REMOVAL OF NULL (EPSILON) PRODUCTIONS - SIMPLIFICATION OF CFG IN AUTOMATA THEORY || TOC
8:46
REMOVAL OF USELESS PRODUCTIONS - SIMPLIFICATION OF CFG IN AUTOMATA THEORY || TOC
14:54
TYPES OF FINITE AUTOMATA (DFA & NFA) IN AUTOMATA THEORY || DFA & NFA || THEORY OF COMPUTATION
14:32
TYPES OF RECURSIONS AND REMOVAL OF LEFT RECURSION IN AUTOMATA THEORY || LEFT RECURSION || TOC
9:55
CONTEXT FREE GRAMMAR IN AUTOMATA THEORY || CFG IN ATFL || TOC || AUTOMATA THEORY
7:10
Lec-55: Remove Unit Production from CFG(Context Free Grammar) in Hindi
8:31