| Chapter |
Option |
| GRAMMARS AND NATURAL LANGUAGE PROCESSING [53:26] |
Watch Here |
| GRAMMARS AND LANGUAGES GENERATED [49:35] |
Watch Here |
| GRAMMARS AND LANGUAGES GENERATED (Contd) [49:27] |
Watch Here |
| AMBIGUITY IN CFG [57:10] |
Watch Here |
| SIMPLICATION OF CFG [56:03] |
Watch Here |
| REMOVAL OF UNIT PRODUCTIONS , CHOMSKY NORMAL FORM FOR CFG [55:11] |
Watch Here |
| GREIBACH NORMAL FORM FOR CFG [50:12] |
Watch Here |
| FINAL STATE AUTOMATA [56:05] |
Watch Here |
| NON DETERMINISTIC FSA [53:53] |
Watch Here |
| NON DETERMINISTIC FSA (Contd) [51:55] |
Watch Here |
| NON DETERMINISTIC FSA WITH E(Epsilon)- MOVES [45:57] |
Watch Here |
| EQUIVALENCE BETWEEN FSA AND TYPE 3 GRAMMARS [58:35] |
Watch Here |
| REGULAR EXPRESSIONS , REGULAR EXPRESSIONS TO NFSA [01:03:50] |
Watch Here |
| DFSA TO REGULAR EXPRESSIONS [57:29] |
Watch Here |
| PROBLEMS AND SOLUTIONS-I [51:55] |
Watch Here |
| PUMPING LEMMAS FOR REGULAR SETS AND CFL [59:50] |
Watch Here |
| MYHILL - NERODE THEOREM [50:13] |
Watch Here |
| MINIMIZATION OF DFSA [55:17] |
Watch Here |
| FSA WITH OUTPUT MOORE AND MEALY MACHINES [51:43] |
Watch Here |
| PUSHDOWN AUTOMATA [45:43] |
Watch Here |
| PUSHDOWN AUTOMATA , EQUIVALENCE BETWEEN ACCEPTANCE BY EMPTY STORE AND ACCEPTANCE BY FINAL STATE [49:42] |
Watch Here |
| PUSHDOWN AUTOMATA CFG TO PDA [50:39] |
Watch Here |
| PUSHDOWN AUTOMATA PDA TO CFG [58:25] |
Watch Here |
| PROBLEMS AND SOLUTIONS-II [50:04] |
Watch Here |
| PROBLEMS AND SOLUTIONS - III [01:04:03] |
Watch Here |
| TURING MACHINES [58:41] |
Watch Here |
| TURING MACHINES (Contd) [52:53] |
Watch Here |
