Computer Sc - Theory of Computation

Course Lectures

• Mod-01 Lec-01 GRAMMARS AND NATURAL LANGUAGE PROCESSING

  Play
• Mod-01 Lec-02 GRAMMARS AND LANGUAGES GENERATED

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

  Play
• Mod-01 Lec-04 AMBIGUITY IN CFG

  Play
• Mod-01 Lec-05 SIMPLICATION OF CFG

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

  Play
• Mod-01 Lec-07 GREIBACH NORMAL FORM FOR CFG

  Play
• Mod-02 Lec-08 FINAL STATE AUTOMATA

  Play
• Mod-02 Lec-09 NON-DETERMINISTIC FSA

  Play
• Mod-02 Lec-10 NON DETERMINISTIC FSA (Contd)

  Play
• Mod-02 Lec-11 NON DETERMINISTIC FSA WITH E(Epsilon)- MOVES

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

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

  Play
• Mod-02 Lec-14 DFSA TO REGULAR EXPRESSIONS

  Play
• Mod-02 Lec-15 PROBLEMS AND SOLUTIONS

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

  Play
• Mod-02 Lec-17 MYHILL-NERODE THEOREM

  Play
• Mod-02 Lec-18 MINIMIZATION OF DFSA

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

  Play
• Mod-03 Lec-20 PUSHDOWN AUTOMATA

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

  Play
• Mod-03 Lec-22 PUSHDOWN AUTOMATA CFG TO PDA

  Play
• Mod-04 Lec-23 PUSHDOWN AUTOMATA PDA TO CFG

  Play
• Mod-04 Lec-24 PROBLEMS AND SOLUTIONS-I

  Play
• Mod-04 Lec-25 PROBLEMS AND SOLUTIONS - III

  Play
• Mod-05 Lec-26 TURING MACHINES

  Play
• Mod-05 Lec-27 TURING MACHINES (Contd)

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

  Play
• Mod-05 Lec-29 GENERALIZED VERSIONS OF TURING MACHINES

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

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

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

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

  Play
• Mod-09 Lec-41 DNA COMPUTING

  Play
• Mod-08 Lec-40 GRAMMAR SYSTEMS

  Play
• Mod-08 Lec-39 L - SYSTEMS

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

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

  Play
• Mod-06 Lec-34 POST'S CORRESPONDENCE PROBLEMS

  Play
• Mod-08 Lec-38 REGULATED REWRITING

  Play
• Mod-09 Lec-42 MEMBRANE COMPUTING

  Play
• Mod-07 Lec-37 NP - COMPLETE PROBLEMS (Contd)

  Play