Courses
Data Structure...
Login
Home
/
CSE
/
Theory of Computation
Syllabus
Quiz
PPTs
CSE
Theory of Computation
START LEARNING
Get Neso Fuel
Chapter 1
•
3 lectures
Introduction to TOC
Chapter 2
•
11 lectures
DFA and NFA
Chapter 3
•
5 lectures
Conversion of NFA to DFA
Chapter 4
•
7 lectures
Minimization of DFA
Chapter 5
•
14 lectures
Mealy & Moore Machine
Chapter 6
•
4 lectures
Epsilon NFA
Chapter 7
•
13 lectures
Regular Expression
Chapter 8
•
2 lectures
Equivalence of Finite Automata
Chapter 9
•
3 lectures
Pumping Lemma (Reg. Languages)
Chapter 10
•
9 lectures
Regular Grammar
Chapter 11
•
6 lectures
Context Free Languages
Chapter 12
•
4 lectures
Chomsky & Greibach Normal Forms
Chapter 13
•
3 lectures
Pumping Lemma (CFL)
Chapter 14
•
9 lectures
Pushdown Automata
Chapter 15
•
14 lectures
Turing Machine
Chapter 16
•
7 lectures
Undecidability & Conclusion
CSE
Theory of Computation
START LEARNING
Get Neso Fuel
