REGULAR GRAMMAR IN AUTOMATA THEORY || GRAMMAR || LEFT LINEAR GRAMMAR || RIGHT LINEAR GRAMMAR || TOC
9:55
CONTEXT FREE GRAMMAR IN AUTOMATA THEORY || CFG IN ATFL || TOC || AUTOMATA THEORY
16:39
PUMPING LEMMA IN AUTOMATA THEORY || PUMPING LEMMA FOR REGULAR LANGUAGES WITH EXAMPLES || TOC
18:06
CONVERSION OF NFA TO DFA WITH EXAMPLES IN AUTOMATA THEORY || NFA TO DFA CONVERSION || TOC
14:36
Conversion from Right Linear Grammar to Left Linear Grammar || Regular Grammar || TOC
10:53
AMBIGUOUS GRAMMAR IN AUTOMATA THEORY || AMBIGUITY IN CONTEXT FREE GRAMMAR || TOC
8:11
DIFFERENCE BETWEEN REULAR GRAMMAR AND CONTEXT FREE GRAMMAR IN AUTOMATA THEORY || TOC
20:53
CONVERSION OF REGULAR EXPRESSION TO FINITE AUTOMATA USING SUBSET METHOD IN AUTOMATA THEORY || TOC
8:34