Theory of Automata, Formal Languages and Computation by Kamala Krithivasan (IIT Madras)

# click the upper-left icon to select videos from the playlist

source: nptelhrd     2011年10月5日
Computer - Theory of Automata, Formal Languages and Computation by Prof. Kamala Krithivasan, Department of Computer Science and Engineering, IIT Madras. For more details on NPTEL visit http://nptel.iitm.ac.in

01 GRAMMARS AND NATURAL LANGUAGE PROCESSING 53:26
02 GRAMMARS AND LANGUAGES GENERATED 49:35
03 GRAMMARS AND LANGUAGES GENERATED (Contd) 49:27
04 AMBIGUITY IN CFG 57:10
05 SIMPLICATION OF CFG 56:03
06 REMOVAL OF UNIT PRODUCTIONS , CHOMSKY NORMAL FORM FOR CFG 55:11
07 GREIBACH NORMAL FORM FOR CFG 50:12
08 FINAL STATE AUTOMATA 56:05
09 NON-DETERMINISTIC FSA 53:53
10 NON DETERMINISTIC FSA (Contd) 45:15
11 NON DETERMINISTIC FSA WITH E(Epsilon)- MOVES 45:48
12 EQUIVALENCE BETWEEN FSA AND TYPE 3 GRAMMARS 58:35
13 REGULAR EXPRESSIONS , REGULAR EXPRESSIONS TO NFSA 1:03:50
14 DFSA TO REGULAR EXPRESSIONS 57:29
15 PROBLEMS AND SOLUTIONS 51:55
16 PUMPING LEMMAS FOR REGULAR SETS AND CFL 59:50
17 MYHILL-NERODE THEOREM 50:13
18 MINIMIZATION OF DFSA 55:17
19 FSA WITH OUTPUT MOORE AND MEALY MACHINES 51:43
20 PUSHDOWN AUTOMATA 45:43
21 PUSHDOWN AUTOMATA,EQUIVALENCE BETWEEN ACCEPTANCE BY EMPTY STORE 49:42
22 PUSHDOWN AUTOMATA CFG TO PDA 50:39
23 PUSHDOWN AUTOMATA PDA TO CFG 58:25
24 PROBLEMS AND SOLUTIONS-I 50:04
25 PROBLEMS AND SOLUTIONS - III 1:04:03
26 TURING MACHINES 58:41
27 TURING MACHINES (Contd) 52:53
28 TURING MACHINE AS ACCEPTOR, TECHNIQUES FOR TM CONSTRUCTION 57:06
29 GENERALIZED VERSIONS OF TURING MACHINES 57:35
30 TURING MACHINE AS A GENERATING DEVICE 1:00:09
31 RECURSIVE SETS , RECURSIVELY INNUMERABLE SETS , ENCODING OF TM , HALTING PROBLEM 57:22
32 PROBLEMS AND INSTANCES , UNIVERSAL TM , DECIDABILITY 59:03
33 RICE'S THEOREM,LINEAR BOUNDED AUTOMATA,PROPERTIES OF TM 54:17
34 POST'S CORRESPONDENCE PROBLEMS 50:49
35 POST'S CORRESPONDENCE PROBLEMS (Contd) TIME AND TAPE COMPLEXITY OT TM 53:51
36 NP - COMPLETE PROBLEMS , COOK'S THEOREM 1:10:06
37 NP - COMPLETE PROBLEMS (Contd) 1:01:20
38 REGULATED REWRITING 59:59
39 L - SYSTEMS 55:05
40 GRAMMAR SYSTEMS 56:21
41 DNA COMPUTING 1:02:00
42 MEMBRANE COMPUTING 56:28