Closure properties of Regular Languages || Regular Sets || TOC || FLAT || Theory of Computation
9:23
Definition of CFG with an Example || Context Free Grammar || TOC || Theory of Computation|| FLAT| CD
8:59
Pumping Lemma for Regular Languages with an example || Theory of Computation || TOC || FLAT
7:29
Closure properties of Context Free Languages || CFG || TOC || FLAT || Theory of Computation
12:49
Conversion of Regular expression to Finite Automata using Direct Method || Theory of computation
16:39
PUMPING LEMMA IN AUTOMATA THEORY || PUMPING LEMMA FOR REGULAR LANGUAGES WITH EXAMPLES || TOC
15:26
Construct PDA for the language L={a^n b^n} || Pushdown Automata || TOC || FLAT || Theory of Comp
18:37
NFA Examples || Non Deterministic Finite Automata || Theory of Computation || TOC || FLAT
16:33