Theory of Computation ( TOC ) (English)

   Monday, November 20, 2023   

Starting a new Lecture Notes Series on Theory of Computation ( TOC )

Youtube Lecture Playlist Credits 

Channel Name: Education 4u

So Let Us Start to This Journey of Learning 

Theory of Computation ( TOC ) By Lecture Notes together!

Lecture Description of this above Topic:

Lecture 1: TOC introduction | TOC | Lec-1

Lecture 2: symbol, alphabet, string | basic definations | TOC | Lec-2

Lecture 3: sempty, lenght, concatenation of string | TOC | Lec-3

Lecture 4: power of alphabet | TOC | Lec-4

Lecture 5: languages & operations | TOC | Lec-5

Lecture 6: finite automata | TOC | Lec-6

Lecture 7: transition diagrams, table and function | finite automata | TOC | Lec-7

Lecture 8: finite automata | applications & different type | TOC | Lec-8

Lecture 9: deterministic finite automata (DFA) | TOC | Lec-9

Lecture 10: dfa example with solution | Part-1 | TOC | Lec-10

Lecture 11: dfa example with solution | Part-2 | TOC | Lec-11

Lecture 12: dfa example with solution | Part-3 | TOC | Lec-12

Lecture 13: non deterministic finite automata (NFA) | TOC | Lec-13

Lecture 14: NFA example | Part-1 | TOC | Lec-14

Lecture 15: NFA example | Part-2 | TOC | Lec-15

Lecture 16: NFA example | Part-3 | TOC | Lec-16

Lecture 17: nfa with epsilon | TOC | Lec-17

Lecture 18: nfa and dfa differences | TOC | Lec-18

Lecture 19: conversion of nfa to dfa examples | Part-1 | TOC | Lec-19

Lecture 20: conversion of NFA to DFA example | Part-2 | TOC | Lec-20

Lecture 21: equivalence of two finite automata | TOC | Lec-21

Lecture 22: equivalence of two FA example | TOC | Lec-22

Lecture 23: minimization of DFA | TOC | Lec-23

Lecture 24: minimization of DFA example | TOC | Lec-24

Lecture 25: Mealy machine | TOC | Lec-25

Lecture 26: mealy machine design | Example1 | TOC | Lec-26

Lecture 27: mealy machine design | Example2 | TOC | Lec-27

Lecture 28: mealy machine design | Example3 | TOC | Lec-28

Lecture 29: moore machine | TOC | Lec-29

Lecture 30: moore machine design | Example1 | TOC | Lec-30

Lecture 31: moore machine design | Example2 | TOC | Lec-31

Lecture 32: moore machine design | Example3 | TOC | Lec-32

Lecture 33: mealy and moore machine | differences | TOC | Lec-33

Lecture 34: mealy to moore conversion | TOC | Lec-34

Lecture 35: mealy to moore example | TOC | Lec-35

Lecture 36: mealy to moore example 2 | TOC | Lec-36

Lecture 37: moore to mealy machine conversion | Example-1 | TOC | Lec-37

Lecture 38: moore to mealy machine conversion | Example-2 | TOC | Lec-38

Lecture 39: moore to mealy machine conversion | Example-3 | TOC | Lec-39

Lecture 40: regular expressions in theory of automata | TOC | Lec-40

Lecture 41: regular expression | Examples | TOC | Lec-41

Lecture 42: convert regular expression to finite automata | TOC | Lec-42

Lecture 43: convert regular expression to finite automata | examples | TOC | Lec-43

Lecture 44: closure properties of regular languages | Part-1| TOC | Lec-44

Lecture 45: closure properties of regular languages | Part-2 | TOC | Lec-45

Lecture 46: pumping lemma for RL | TOC | Lec-46

Lecture 47: pumping lemma for RL example | TOC | Lec-47

Lecture 48: context free grammer | Introduction | TOC | Lec-48

Lecture 49: context free grammar in automata |Example-1 | TOC | Lec-49

Lecture 50: context free grammar in automata | Example-2 | TOC | Lec-50

Lecture 51: context free grammar in automata | Example-3 | TOC | Lec-51

Lecture 52: derivation in theory of computation | TOC | Lec-52

Lecture 53: leftmost and rightmost derivations | Example-1 | TOC | Lec-53

Lecture 54: leftmost and rightmost derivations | Example-2 | TOC | Lec-54

Lecture 55: leftmost and rightmost derivations | Example-3 | TOC | Lec-55

Lecture 56: derivation tree | TOC | Lec-56

Lecture 57: derivation tree example 1 | TOC | Lec-57

Lecture 58: derivation tree Example 2 | TOC | Lec-58

Lecture 59: ambiguity in grammar | TOC | Lec-59

Lecture 60: ambiguity in grammar example 1 | TOC | Lec-60

Lecture 61: ambiguity in grammar example 2 | TOC | Lec-61

Lecture 62: unambiguous grammar | TOC | Lec-62

Lecture 63: unambiguous grammar example 1 | TOC | Lec-63

Lecture 64: unambiguous grammar example 2 | TOC | Lec-64

Lecture 65: simplification of CFG | TOC | Lec-65

Lecture 66: removal of useless symbols | CFG | TOC | Lec-66

Lecture 67: elimination of epsilon production | TOC | Lec-67

Lecture 68: removal of unit production | CFG | TOC | Lec-68

Lecture 69: Chomsky normal form | TOC | Lec-69

Lecture 70: converting CFG to CNF | steps | TOC | Lec-70

Lecture 71: converting CFG to CNF example | TOC | Lec-71

Lecture 72: griebach normal form | TOC | Lec-72

Lecture 73: converting CFG to GNF example-1 | TOC | Lec-73

Lecture 74: converting CFG to GNF example - 2 | TOC | Lec-74

Lecture 75: pumping lemmafor CFL | TOC | Lec-75

Lecture 76: pumping lemma example | Part-1 | TOC | Lec-76

Lecture 77: pumping lemma example | Part-2 | TOC | Lec-77

Lecture 78: pushdown automata (PDA) in TOC | Introduction | Part-1/2| Lec-78

Lecture 79: pushdown automata (PDA) in TOC | Introduction | Part-2/2| Lec-79

Lecture 80: pushdown automata (PDA) | terminologies used | TOC | Lec-80

Lecture 81: pushdown automata (PDA) acceptance | TOC | Lec-81

Lecture 82: pushdown automata example | Part-1/2 | TOC | Lec-82

Lecture 83: pushdown automata example | Part-2/2 | TOC | Lec-83

Lecture 84: cfg to pda conversion | conversion | TOC | Lec-84

Lecture 85: Turing machine ( TM) | Introduction | Part-1/2 | TOC | Lec-85

Lecture 86: Turing machine (TM) | Introduction | Part-2/2 | TOC | Lec-86

Lecture 87: Turing machine (TM) | operation on tape | TOC | Lec-87

Lecture 88: turing thesis | turing machine | TOC | Lec-88

Lecture 89: Turing machine(TM) language | TOC | Lec-89

Lecture 90: turing machine | Example-1 | TOC | Lec-90

Lecture 91: turing machine | Example-2 | TOC | Lec-91

Lecture 92: variants of TM | Multitape & Non deterministic | Part-1/2 | TOC | Lec-92

Lecture 93: variants of TM | Multihead & Offline | Part-2/2 | TOC | Lec-93

Lecture 94: Recursive & Recursively enumerable languages | TOC | Lec-94

Lecture 95: halting problem | Turing Machine(TM) | TOC | Lec-95

Lecture 96: complexity classes | P & NP | TOC | Lec-96