'POST'S CORRESPONDENCE PROBLEMS' Video Lecture

POST'S CORRESPONDENCE PROBLEMS

  • Course: Theory of Automata, Formal Languages and Computation
  • Discipline: Computer Science and Engineering
  • Faculty: Prof. Kamala Krithivasan
  • Institute: IIT Madras

    • POST'S CORRESPONDENCE PROBLEMS - Click on the Video Link shown below to play the video on Youtube. Browse through Theory of Automata, Formal Languages and Computation (Computer Science and Engineering) Video Lectures by Prof. Kamala Krithivasan from IIT Madras through NPTEL.

    NEXT LECTURE >> POST'S CORRESPONDENCE PROBLEMS (Contd), TIME AND TAPE COMPLEXITY OT TM
    Download this video in MP4, FLV & 3GP formats
    Format  Size  Download
    MP4 427 MB MP4 Video Download Link 1
    FLV 114 MB FLV Video Download Link 1
    3gp 61 MB 3gp Video Download Link 1
    Search Courses
    Course Video Lectures GRAMMARS AND NATURAL LANGUAGE PROCESSING GRAMMARS AND LANGUAGES GENERATED GRAMMARS AND LANGUAGES GENERATED (Contd) AMBIGUITY IN CFG SIMPLICATION OF CFG REMOVAL OF UNIT PRODUCTIONS , CHOMSKY NORMAL .. GREIBACH NORMAL FORM FOR CFG FINAL STATE AUTOMATA NON DETERMINISTIC FSA NON DETERMINISTIC FSA (Contd) NON DETERMINISTIC FSA WITH E(Epsilon)- MOVES EQUIVALENCE BETWEEN FSA AND TYPE 3 GRAMMARS REGULAR EXPRESSIONS , REGULAR EXPRESSIONS TO .. DFSA TO REGULAR EXPRESSIONS PROBLEMS AND SOLUTIONS-I PUMPING LEMMAS FOR REGULAR SETS AND CFL MYHILL - NERODE THEOREM MINIMIZATION OF DFSA FSA WITH OUTPUT MOORE AND MEALY MACHINES PUSHDOWN AUTOMATA PUSHDOWN AUTOMATA , EQUIVALENCE BETWEEN ACCEP.. PUSHDOWN AUTOMATA CFG TO PDA PUSHDOWN AUTOMATA PDA TO CFG PROBLEMS AND SOLUTIONS-II PROBLEMS AND SOLUTIONS - III TURING MACHINES TURING MACHINES (Contd) TURING MACHINE AS ACCEPTOR , TECHNIQUES FOR T.. GENERALIZED VERSIONS OF TURING MACHINES TURING MACHINE AS A GENERATING DEVICE RECURSIVE SETS , RECURSIVELY INNUMERABLE SETS.. PROBLEMS AND INSTANCES , UNIVERSAL TM , DECID.. RICE'S THEOREM , LINEAR BOUNDED AUTOMATA , PR.. POST'S CORRESPONDENCE PROBLEMS POST'S CORRESPONDENCE PROBLEMS (Contd), TIME .. NP - COMPLETE PROBLEMS , COOK'S THEOREM NP - COMPLETE PROBLEMS (Contd) REGULATED REWRITING L - SYSTEMS GRAMMAR SYSTEMS DNA COMPUTING MEMBRANE COMPUTING
    2015. EngineeringVideoLectures.com