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
12:10
Closure properties of regular Languages(with proof) | Union | Concatenation | Complement |TOC
7:29
Closure properties of Context Free Languages || CFG || TOC || FLAT || Theory of Computation
1:00:34
1. Introduction, Finite Automata, Regular Expressions
24:55
Elle s'échappe de Corée du Nord à 15 ans (et nous raconte tout)
8:56
Prove that L={ a^p p is prime} is not regular || Pumping Lemma for Regular Languages || TOC || FLAT
42:13