4th semester Theory of computation PPT's

     (Click to Download PPT)
 

Introduction and Chapter 1: Fundamentals

Chapter 2: Finite Automata

Chapter 3: Closure Properties for Regular Languages

Chapter 4: DFA Applications

Chapter 5: Nondeterministic Finite Automata

Chapter 6: NFA Applications

Chapter 7: Regular Expressions

Chapter 8: Regular Expression Applications

Chapter 9: Advanced Topics in Regular Languages

Chapter 10: Grammars

Chapter 11: Non-Regular Languages

Chapter 12: Context-Free Languages

Chapter 13: Stack Machines

Chapter 14: Stack Machine Applications

Chapter 15: Turing Machines

Chapter 16: Computability

Chapter 17: Uncomputability 

Chapter 18: Cost Models

PPT set-2 

Click to Downoad PPT	Size
Lecture1.ppt	39K
Lecture2.ppt	221K
Lecture3.ppt	745K
Lecture4.ppt	274K
Lecture5.ppt	272K
Lecture7.ppt	248K
Lecture8.ppt	54K
Lecture9.ppt	111K
Lecture10.ppt	79K
Lecture11.ppt	837K
Lecture12.ppt	15K
Lecture14.ppt	1.4M
Lecture14a.ppt	1.1M
Lecture15.ppt	71K
Lecture16.ppt	731K
Lecture17.ppt	1.5M
Lecture17.ppt	711K
Lecture18.ppt	320K
Lecture23.ppt	120K
Lecture23b.ppt	153K
Lecture24.ppt	82K
Lecture25.ppt	103K
Lecture25b.ppt	57K
Lecture27.ppt	117K