Find Your Courses

Mod-01 Lec-01 GRAMMARS AND NATURAL LANGUAGE PROCESSING

 Duration 0h 54m

Mod-01 Lec-02 GRAMMARS AND LANGUAGES GENERATED

 Duration 0h 50m

Mod-01 Lec-03 GRAMMARS AND LANGUAGES GENERATED (Contd)

 Duration 0h 50m

Mod-01 Lec-04 AMBIGUITY IN CFG

 Duration 0h 58m

Mod-01 Lec-05 SIMPLICATION OF CFG

 Duration 0h 57m

Mod-01 Lec-06 REMOVAL OF UNIT PRODUCTIONS , CHOMSKY NORMAL FORM FOR CFG

 Duration 0h 56m

Mod-01 Lec-07 GREIBACH NORMAL FORM FOR CFG

 Duration 0h 51m

Mod-02 Lec-08 FINAL STATE AUTOMATA

 Duration 0h 57m

Mod-02 Lec-09 NON-DETERMINISTIC FSA

 Duration 0h 54m

Mod-02 Lec-10 NON DETERMINISTIC FSA -Contd

 Duration 0h 46m

Mod-02 Lec-11 NON DETERMINISTIC FSA WITH E- MOVES

 Duration 0h 46m

Mod-02 Lec-12 EQUIVALENCE BETWEEN FSA AND TYPE 3 GRAMMARS

 Duration 0h 58m

Mod-02 Lec-13 REGULAR EXPRESSIONS , REGULAR EXPRESSIONS TO NFSA

 Duration 1h 1m

Mod-02 Lec-14 DFSA TO REGULAR EXPRESSIONS

 Duration 0h 58m

Mod-02 Lec-15 PROBLEMS AND SOLUTIONS

 Duration 0h 52m

Mod-02 Lec-16 PUMPING LEMMAS FOR REGULAR SETS AND CFL

 Duration 1h 1m

Mod-02 Lec-17 MYHILL-NERODE THEOREM

 Duration 0h 51m

Mod-02 Lec-18 MINIMIZATION OF DFSA

 Duration 0h 56m

Mod-02 Lec-19 FSA WITH OUTPUT MOORE AND MEALY MACHINES

 Duration 0h 52m

Mod-03 Lec-20 PUSHDOWN AUTOMATA

 Duration 0h 46m

Mod-03 Lec-21 PUSHDOWN AUTOMATA,EQUIVALENCE BETWEEN ACCEPTANCE BY EMPTY STORE

 Duration 0h 50m

Mod-03 Lec-22 PUSHDOWN AUTOMATA CFG TO PDA

 Duration 0h 51m

Mod-04 Lec-23 PUSHDOWN AUTOMATA PDA TO CFG

 Duration 0h 59m

Mod-04 Lec-24 PROBLEMS AND SOLUTIONS-I

 Duration 0h 51m

Mod-04 Lec-25 PROBLEMS AND SOLUTIONS - III

 Duration 1h 1m

Mod-05 Lec-26 TURING MACHINES

 Duration 0h 59m

Mod-05 Lec-27 TURING MACHINES (Contd)

 Duration 0h 53m

Mod-05 Lec-28 TURING MACHINE AS ACCEPTOR , TECHNIQUES FOR TM CONSTRUCTION

 Duration 0h 58m

Mod-05 Lec-29 GENERALIZED VERSIONS OF TURING MACHINES

 Duration 0h 58m

Mod-05 Lec-30 TURING MACHINE AS A GENERATING DEVICE

 Duration 1h 1m

Mod-06 Lec-31 RECURSIVE SETS , RECURSIVELY INNUMERABLE SETS , ENCODING OF TM , HALTING PROBLEM

 Duration 0h 58m

Mod-06 Lec-32 PROBLEMS AND INSTANCES , UNIVERSAL TM , DECIDABILITY

 Duration 1h 1m

Mod-06 Lec-33 RICE'S THEOREM,LINEAR BOUNDED AUTOMATA,PROPERTIES OF TM

 Duration 0h 55m

Mod-06 Lec-34 POST'S CORRESPONDENCE PROBLEMS

 Duration 0h 51m

Mod-07 Lec-35 POST'S CORRESPONDENCE PROBLEMS (Contd) TIME AND TAPE COMPLEXITY OT TM

 Duration 0h 54m

Mod-07 Lec-36 NP - COMPLETE PROBLEMS , COOK'S THEOREM

 Duration 1h 1m

Mod-08 Lec-37 REGULATED REWRITING

 Duration 1h 1m

Mod-08 Lec-38 L - SYSTEMS

 Duration 0h 56m

Mod-08 Lec-39 GRAMMAR SYSTEMS

 Duration 0h 57m

Mod-09 Lec-40 DNA COMPUTING

 Duration 1h 2m

Mod-09 Lec-41 MEMBRANE COMPUTING

 Duration 0h Select Minutes m