Главная
Study mode:
on
1
Mod-01 Lec-01 GRAMMARS AND NATURAL LANGUAGE PROCESSING
2
Mod-01 Lec-02 GRAMMARS AND LANGUAGES GENERATED
3
Mod-01 Lec-03 GRAMMARS AND LANGUAGES GENERATED (Contd)
4
Mod-01 Lec-04 AMBIGUITY IN CFG
5
Mod-01 Lec-05 SIMPLICATION OF CFG
6
Mod-01 Lec-06 REMOVAL OF UNIT PRODUCTIONS , CHOMSKY NORMAL FORM FOR CFG
7
Mod-01 Lec-07 GREIBACH NORMAL FORM FOR CFG
8
Mod-02 Lec-08 FINAL STATE AUTOMATA
9
Mod-02 Lec-09 NON-DETERMINISTIC FSA
10
Mod-02 Lec-10 NON DETERMINISTIC FSA (Contd)
11
Mod-02 Lec-11 NON DETERMINISTIC FSA WITH E(Epsilon)- MOVES
12
Mod-02 Lec-12 EQUIVALENCE BETWEEN FSA AND TYPE 3 GRAMMARS
13
Mod-02 Lec-13 REGULAR EXPRESSIONS , REGULAR EXPRESSIONS TO NFSA
14
Mod-02 Lec-14 DFSA TO REGULAR EXPRESSIONS
15
Mod-02 Lec-15 PROBLEMS AND SOLUTIONS
16
Mod-02 Lec-16 PUMPING LEMMAS FOR REGULAR SETS AND CFL
17
Mod-02 Lec-17 MYHILL-NERODE THEOREM
18
Mod-02 Lec-18 MINIMIZATION OF DFSA
19
Mod-02 Lec-19 FSA WITH OUTPUT MOORE AND MEALY MACHINES
20
Mod-03 Lec-20 PUSHDOWN AUTOMATA
21
Mod-03 Lec-21 PUSHDOWN AUTOMATA,EQUIVALENCE BETWEEN ACCEPTANCE BY EMPTY STORE
22
Mod-03 Lec-22 PUSHDOWN AUTOMATA CFG TO PDA
23
Mod-04 Lec-23 PUSHDOWN AUTOMATA PDA TO CFG
24
Mod-04 Lec-24 PROBLEMS AND SOLUTIONS-I
25
Mod-04 Lec-25 PROBLEMS AND SOLUTIONS - III
26
Mod-05 Lec-26 TURING MACHINES
27
Mod-05 Lec-27 TURING MACHINES (Contd)
28
Mod-05 Lec-28 TURING MACHINE AS ACCEPTOR , TECHNIQUES FOR TM CONSTRUCTION
29
Mod-05 Lec-29 GENERALIZED VERSIONS OF TURING MACHINES
30
Mod-05 Lec-30 TURING MACHINE AS A GENERATING DEVICE
31
Mod-06 Lec-31 RECURSIVE SETS , RECURSIVELY INNUMERABLE SETS , ENCODING OF TM , HALTING PROBLEM
32
Mod-06 Lec-32 PROBLEMS AND INSTANCES , UNIVERSAL TM , DECIDABILITY
33
Mod-06 Lec-33 RICE'S THEOREM,LINEAR BOUNDED AUTOMATA,PROPERTIES OF TM
34
Mod-06 Lec-34 POST'S CORRESPONDENCE PROBLEMS
35
Mod-07 Lec-35 POST'S CORRESPONDENCE PROBLEMS (Contd) TIME AND TAPE COMPLEXITY OT TM
36
Mod-07 Lec-36 NP - COMPLETE PROBLEMS , COOK'S THEOREM
37
Mod-07 Lec-37 NP - COMPLETE PROBLEMS (Contd)
38
Mod-08 Lec-38 REGULATED REWRITING
39
Mod-08 Lec-39 L - SYSTEMS
40
Mod-08 Lec-40 GRAMMAR SYSTEMS
41
Mod-09 Lec-41 DNA COMPUTING
42
Mod-09 Lec-42 MEMBRANE COMPUTING
Description:
Instructor: Prof. Kamala Krithivasan, Department of Computer Science and Engineering, IIT Madras. This course provides an introduction to the basic models of computability, covering topics like grammars, context-free grammars, finite state automata, and regular expressions, pushdown automata, Turing machines, decidability, complexity theory, DNA computing, membrane computing.

Theory of Automata, Formal Languages and Computation

NPTEL
Add to list
#Computer Science #Automata Theory #Programming #Domain-Specific Languages (DSL) #Regular Expressions #Theoretical Computer Science #Turing Machines #Algorithms #Computational Complexity Theory #NP-Complete Problems #Formal Languages
0:00 / 0:00
1 of 42

Mod-01 Lec-01 GRAMMARS AND NATURAL LANGUAGE PROCESSING