 |
Grammars and Natural Language Processing |
Computer Science |
53 min |
Click to view videos |
 |
Grammars and languages generated |
Computer Science |
49 min |
Click to view videos |
 |
Grammars and languages generated (cont…) |
Computer Science |
49 min |
Click to view videos |
 |
Ambiguity in CFG |
Computer Science |
57 min |
Click to view videos |
 |
Simplification of CFG |
Computer Science |
56 min |
Click to view videos |
 |
Removal of unit productions, Chomsky Normal Form for CFG |
Computer Science |
55 min |
Click to view videos |
 |
Greibach Normal Form for CFG |
Computer Science |
50 min |
Click to view videos |
 |
Final State Automata |
Computer Science |
56 min |
Click to view videos |
 |
Non-deterministic FSA |
Computer Science |
53 min |
Click to view videos |
 |
Non-deterministic FSA(cont…) |
Computer Science |
51 min |
Click to view videos |
 |
Non-deterministic FSA with E(Epsilon)-Moves |
Computer Science |
45 min |
Click to view videos |
 |
Equivalence between FSA and Type 3 grammars |
Computer Science |
58 min |
Click to view videos |
 |
Regular Expressions, Regular Expressions to NFSA |
Computer Science |
63 min |
Click to view videos |
 |
DFSA to Regular Expressions |
Computer Science |
57 min |
Click to view videos |
 |
Problems and Solutions -1 |
Computer Science |
51 min |
Click to view videos |
 |
Pumping Lemmas for Regular Sets and CFL |
Computer Science |
59 min |
Click to view videos |
 |
Myhill-Nerode Theorem |
Computer Science |
50 min |
Click to view videos |
 |
Minimization of DFSA |
Computer Science |
55 min |
Click to view videos |
 |
FSA with output Moore and Mealy machines |
Computer Science |
51 min |
Click to view videos |
 |
Pushdown Automata |
Computer Science |
45 min |
Click to view videos |
 |
Equivalence between acceptance by empty store and acceptance by final state |
Computer Science |
49 min |
Click to view videos |
 |
Pushdown Automata CFG to PDA |
Computer Science |
50 min |
Click to view videos |
 |
Pushdown Automata PDA to CFG |
Computer Science |
58 min |
Click to view videos |
 |
Problems and Solutions 2 |
Computer Science |
50 min |
Click to view videos |
 |
Problems and Solutions 3 |
Computer Science |
64 min |
Click to view videos |
 |
Turing Machines |
Computer Science |
58 min |
Click to view videos |
 |
Turing Machines (cont…) |
Computer Science |
52 min |
Click to view videos |
 |
Turing Machine as Acceptor, Techiniques for TM Construction |
Computer Science |
57 min |
Click to view videos |
 |
Generalized versions of Turing Machines |
Computer Science |
57 min |
Click to view videos |
 |
Turing Machine as a generating device |
Computer Science |
60 min |
Click to view videos |
 |
Recursive Sets, Encoding of TM, Halting Problem |
Computer Science |
57 min |
Click to view videos |
 |
Problems and Instances, Universla TM, Decidability |
Computer Science |
59 min |
Click to view videos |
 |
Rice Theorem, Linear Bounded Automata, Properties of TM |
Computer Science |
54 min |
Click to view videos |
 |
Posts correspondence problems |
Computer Science |
50 min |
Click to view videos |
 |
Posts correspondence problems (cont…), Time and Tape Complexity of TM |
Computer Science |
53 min |
Click to view videos |
 |
NP- Complete Problems, Cooks Theorem |
Computer Science |
70 min |
Click to view videos |
 |
NP- Complete Problems (Cont…) |
Computer Science |
61 min |
Click to view videos |
 |
Regulated rewriting |
Computer Science |
60 min |
Click to view videos |
 |
L-Systems |
Computer Science |
55 min |
Click to view videos |
 |
Grammar Systems |
Computer Science |
56 min |
Click to view videos |
 |
DNA Computing |
Computer Science |
62 min |
Click to view videos |
 |
Membrane Computing |
Computer Science |
56 min |
Click to view videos |
Leave a Reply