TOC Course offers a comprehensive package with over 78 videos, covering critical topics such as:
- Deterministic Finite Automata (DFA)
- Non-Deterministic Finite Automata (NFA)
- Moore Machine
- Mealy Machine
- Arden's Theorem
- Grammar (including CFG)
- Pumping Lemma
- Push Down Automata (PDA)
- Turing Machine
This course provides a complete foundation for anyone preparing for an engineering exam in computation theory.
-
Videos
- Syllabus
- Lecture 1
- Lecture 2
- Lecture 3
- Lecture 4
- Lecture 5
- Lecture 6
- Lecture 7
- Lecture 8
- Lecture 9
- Lecture 10
- Lecture 11
- Lecture 12
- Lecture 13
- Lecture 14
- Lecture 15
- Lecture 16
- Lecture 17
- Lecture 18
- Lecture 19
- Lecture 20
- Lecture 21
- Lecture 22
- Lecture 23
- Lecture 24
- Lecture 25
- Lecture 26
- Lecture 27
- Lecture 28
- Lecture 29
- Lecture 30
- Lecture 31
- Lecture 32
- Lecture 33
- Lecture 34
- Lecture 35
- Lecture 36
- Lecture 37
- Lecture 38
- Lecture 39
- Lecture 40
- Lecture 41
- Lecture 42
- Lecture 43
- Lecture 44
- Lecture 45
- Lecture 46
- Lecture 47
- Lecture 48
- Lecture 49
- Lecture 50
- Lecture 51
- Lecture 52
- Lecture 53
- Lecture 54
- Lecture 55
- Lecture 56
- Lecture 57
- Lecture 58
- Lecture 59
- Lecture 60
- Lecture 61
- Lecture 62
- Lecture 63
- Lecture 64
- Lecture 65
- Lecture 66
- Lecture 67
- Lecture 68
- Lecture 69
- Lecture 70
- Lecture 71
- Lecture 72
- Lecture 73
- Lecture 74
- Lecture 75
- Lecture 76
- Lecture 77
- Lecture 78
-
Ebooks
-
Ebooks