1 | Lecture 1 : Deterministic Finite Automata (DFA) | PDF unavailable |
2 | Lecture 2 : Input alphabet | PDF unavailable |
3 | Lecture 3 : Extended transition function | PDF unavailable |
4 | Lecture 4 : Language of DFA | PDF unavailable |
5 | Lecture 5 : Building DFA | PDF unavailable |
6 | Lecture 06:Building DFA (contd…) | PDF unavailable |
7 | Lecture 07: NFA (Nondeterministic Finite Automata) | PDF unavailable |
8 | Lecture 08: Language of a NFA | PDF unavailable |
9 | Lecture 09: Equivalence of DFA’s and NFA’s | PDF unavailable |
10 | Lecture 10: Subset Construction | PDF unavailable |
11 | Lecture 11 : ϵ-NFA | PDF unavailable |
12 | Lecture 12 : Extended transition function of 𝜖-NFA | PDF unavailable |
13 | Lecture 13 : Language of 𝜖-NFA | PDF unavailable |
14 | Lecture 14 : 𝜖-NFA to NFA | PDF unavailable |
15 | Lecture 15 : 𝜖-NFA to DFA | PDF unavailable |
16 | Lecture 16 : Regular expression | PDF unavailable |
17 | Lecture 17 : Regular expression (Contd.) | PDF unavailable |
18 | Lecture 18 : More on regular expression | PDF unavailable |
19 | Lecture 19 : Equivalence of 𝜖-NFA and regular expression | PDF unavailable |
20 | Lecture 20 : Equivalence of 𝜖-NFA and regular expression (Contd.) | PDF unavailable |
21 | Lecture 21: DFA to Regular expression | PDF unavailable |
22 | Lecture 22: DFA to Regular expression (Contd.) | PDF unavailable |
23 | Lecture 23: Construction of regular expression from a DFA (example) | PDF unavailable |
24 | Lecture 24: Closure properties of Regular Set | PDF unavailable |
25 | Lecture 25: Closure properties of Regular Set (Contd.) | PDF unavailable |
26 | Lecture 26 : Substitution | PDF unavailable |
27 | Lecture 27 : Pumping Lemma | PDF unavailable |
28 | Lecture 28 : Application of the pumping lemma | PDF unavailable |
29 | Lecture 29 : More on Pumping lemma | PDF unavailable |
30 | Lecture 30 : Arden’s Theorem | PDF unavailable |
31 | Lecture 31: Minimization of FA | PDF unavailable |
32 | Lecture 32: Minimization of FA (Cont…) | PDF unavailable |
33 | Lecture 33: Two way FA | PDF unavailable |
34 | Lecture 34: Finite automata with output | PDF unavailable |
35 | Lecture 35: Equivalence of Moore and Mealy machine | PDF unavailable |
36 | Lecture 36: Context free grammars (CFG) | PDF unavailable |
37 | Lecture 37: Context free language (CFL) | PDF unavailable |
38 | Lecture 38: More example on CFL | PDF unavailable |
39 | Lecture 39: More on CFG | PDF unavailable |
40 | Lecture 40: Derivation Tree/Parse Tree | PDF unavailable |
41 | Lecture 41 : Leftmost and Rightmost derivations | PDF unavailable |
42 | Lecture 42 : Ambiguity in CFG | PDF unavailable |
43 | Lecture 43 : Simplification of CFG | PDF unavailable |
44 | Lecture 44 : Algorithms to construct reduced grammar | PDF unavailable |
45 | Lecture 45 : Elimination of Null and Unit productions | PDF unavailable |
46 | Lecture 46 : Chomsky Normal Form (CNF) | PDF unavailable |
47 | Lecture 47 : Greibach Normal Form (GNF) | PDF unavailable |
48 | Lecture 48 : Pushdown Automata (PDA) | PDF unavailable |
49 | Lecture 49 : Language accepted by PDA | PDF unavailable |
50 | Lecture 50 : Example of a language accepted by PDA | PDF unavailable |
51 | Lecture 51 : Deterministic PDA | PDF unavailable |
52 | Lecture 52 : Equivalence of language accepted | PDF unavailable |
53 | Lecture 53 : Equivalence PDA | PDF unavailable |
54 | Lecture 54 : Equivalence PDA and CFL | PDF unavailable |
55 | Lecture 55 : Equivalence PDA and CFL (Contd.) | PDF unavailable |
56 | Lecture 56: Relationship between regular language and CFL | PDF unavailable |
57 | Lecture 57: Pumping lemma for CFLs | PDF unavailable |
58 | Lecture 58: Closer properties of CFLs | PDF unavailable |
59 | Lecture 59: Turning Machine | PDF unavailable |
60 | Lecture 60: Language accepted by a Turning machine | PDF unavailable |