TYPES OF RECURSIONS AND REMOVAL OF LEFT RECURSION IN AUTOMATA THEORY || LEFT RECURSION || TOC
26:59
GREIBACH NORMAL FORM (GNF) AND CONVERSION OF CONTEXT FREE GRAMMAR TO GNF IN AUTOMATA THEORY || TOC
8:46
REMOVAL OF USELESS PRODUCTIONS - SIMPLIFICATION OF CFG IN AUTOMATA THEORY || TOC
10:26
Universal Turing Machine || Binary encoding of Turing machine || TOC || FLAT || Automata Theory
13:45
REGULAR EXPRESSIONS IN AUTOMATA THEORY || REGULAR EXPRESSION WITH EXAMPLE || TOC
13:47
Hardy's Integral
30:42
CHOMSKY NORMAL FORM (CNF) & CONVERSION OF CFG TO CNF IN AUTOMATA THEORY || CFG TO CNF || TOC
15:41
TYPES OF DERIVATION TREE (LEFT-MOST & RIGHT MOST) IN AUTOMATA THEORY || TOC
19:49