Computer - Theory of Automata, Formal Languages and Computation (English)

   Thursday, February 20, 2025   

Starting a new Lecture Notes Series on Computer - Theory of Automata, Formal Languages and Computation

Youtube Lecture Playlist Credits 

Channel Name: nptelhrd

So Let Us Start to This Journey of Learning 

Computer - Theory of Automata, Formal Languages and Computation By Lecture Notes together!

Lecture 1: Mod-01 Lec-01 GRAMMARS AND NATURAL LANGUAGE PROCESSING

Lecture 2: Mod-01 Lec-02 GRAMMARS AND LANGUAGES GENERATED

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

Lecture 4: Mod-01 Lec-04 AMBIGUITY IN CFG

Lecture 5: Mod-01 Lec-05 SIMPLICATION OF CFG

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

Lecture 7: Mod-01 Lec-07 GREIBACH NORMAL FORM FOR CFG

Lecture 8: Mod-02 Lec-08 FINAL STATE AUTOMATA

Lecture 9: Mod-02 Lec-09 NON-DETERMINISTIC FSA

Lecture 10: Mod-02 Lec-10 NON DETERMINISTIC FSA (Contd)

Lecture 11: Mod-02 Lec-11 NON DETERMINISTIC FSA WITH E(Epsilon)- MOVES

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

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

Lecture 14: Mod-02 Lec-14 DFSA TO REGULAR EXPRESSIONS

Lecture 15: Mod-02 Lec-15 PROBLEMS AND SOLUTIONS

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

Lecture 17: Mod-02 Lec-17 MYHILL-NERODE THEOREM

Lecture 18: Mod-02 Lec-18 MINIMIZATION OF DFSA

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

Lecture 20: Mod-03 Lec-20 PUSHDOWN AUTOMATA

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

Lecture 22: Mod-03 Lec-22 PUSHDOWN AUTOMATA CFG TO PDA

Lecture 23: Mod-04 Lec-23 PUSHDOWN AUTOMATA PDA TO CFG

Lecture 24: Mod-04 Lec-24 PROBLEMS AND SOLUTIONS-I

Lecture 25: Mod-04 Lec-25 PROBLEMS AND SOLUTIONS - III

Lecture 26: Mod-05 Lec-26 TURING MACHINES

Lecture 27: Mod-05 Lec-27 TURING MACHINES (Contd)

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

Lecture 29: Mod-05 Lec-29 GENERALIZED VERSIONS OF TURING MACHINES

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

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

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

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

Lecture 34: Mod-06 Lec-34 POST'S CORRESPONDENCE PROBLEMS

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

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

Lecture 37: Mod-07 Lec-37 NP - COMPLETE PROBLEMS (Contd)

Lecture 38: Mod-08 Lec-38 REGULATED REWRITING

Lecture 39: Mod-08 Lec-39 L - SYSTEMS

Lecture 40: Mod-08 Lec-40 GRAMMAR SYSTEMS

Lecture 41: Mod-09 Lec-41 DNA COMPUTING

Lecture 42: Mod-09 Lec-42 MEMBRANE COMPUTING