INTRODUCTION TO FORMAL LANGUAGES AND AUTOMATA THEORY-LECTURE1
CONSTRUCTION OF DFA-LECTURE 2
CONSTRUCTION OF FINITE AUTOMATA -
LECTURE 3
DESIGN OF FINITE AUTOMATA-LECTURE 4
CONSTRUCTION OF FINITE AUTOMATA-
LECTURE 5
CONSTRUCTION OF FINITE AUTOMATA-
LECTURE 6
NON-DETERMINISTIC FINITE AUTOMATA-LECTURE 7
DESIGN OF DFA AND NFA-LECTURE 8
CONSTRUCTION OF NFA-LECTURE 9
EQUIVALENCE BETWEEN TWO FINITE STATE MACHINES-LECTURE 10
CONVERSION OF NFA WITH EPSILON MOVES TO NFA WITHOUT EPSILON MOVES-LECTURE 11
NFA WITH EPSILON TO NFA WITHOUT EPSILON MOVES-LECTURE 12
Chomsky Hierarchy of Languages-Lectur13
FINITE STATE MACHINE MINIMIZATION
-LECTURE 14
MINMIZATION OF DFA-LECTURE 15
CONVERSION OF NFA TO DFA-LECTURE 16
NFA with epsilon to NFA without epsilon-LECTURE 17
INTRODUCTION TO MOORE AND MELAY MACHINE -LECTURE 18
MOORE MACHINE FOR 1's AND 2's complement-LECTURE 19
MOORE MACHINE CONSTRUCTION-LECTURE 20
MOORE MACHINE TO MELAY MACHINE-
LECTURE 21
MELAY MACHINE TO MOORE MACHINE-
LECTURE 22
DESIGN MELAY MACHINE-LECTURE 23
DESIGN MELAY MACHINE-LECTURE 24
MELAY MACHINE FOR BINARY ADDITION-
LECTUR 25
REGULAR SET AND REGULAR EXPRESSION-LECTURE 26
CONSTRUCTION OF REGULAT EXPRESSION-LECTURE 27
REGULAR EXPRESSION IDENTITIES-LECTURE 28
REGULAR EXPRESSION TO NFA WITH EPSILON TRANSITIONS-LECTURE 29
DFA TO REGULAR EXPRESSION-LECTURE 30
DFA TO REGULAR EXPRESSION-LECTURE 31
PUMPING LEMMA FOR REGULAR LANGUAGES-LECTURE 32
PUMPING LEMMA FOR REGULAR LANGUAGES-LECTURE 33
PUMPING LEMMA (FOR REGULAR LANGUAGES)-LECTURE 34
PUMPING LEMMA FOR REGULAR LANGUAGES-LECTURE 35
GRAMMAR-LECTURE 36
CONSTRUCTION OF GRAMMAR-LECTURE 37
CONSTRUCTION OF GRAMMAR-1-LECTURE 38
CONSTRUCTION OF GRAMMAR-2-LECTURE 39
GRAMMAR FOR REGULAR LANGUAGES-
LECTURE 40
SIMPLIFICATION OF CONTEXT FREE GRAMMAR-LECTURE 41
ELIMINATION OF EPSILON PRODUCTIONS-LECTURE 42
ELIMINATION OF USELESS SYMBOLS-LECTURE 43
ELIMINATION OF USELESS SYMBOLS-LECTURE 44
REMOVAL OF UNIT PRODUCTIONS-LECTURE 45
REMOVAL OF UNIT PRODUCTIONS -LECTURE 46
REMOVAL OF UNIT PRODUCTIONS-LECTURE 47
REMOVAL OF UNIT PRODUCTIONS -LECTURE 48
CHOMSKY NORMAL FORM(CNF)-LECTURE 49
CHOMSKY NORMAL FORM(CNF)-LECTURE 50
CHOMSKY NORMAL FORM(CNF)-LECTURE 51
GRIEBACH NORMAL FORM-LECTUR 52
GRIEBACH NORMAL FORM-LECTURE 53
GRIEBACH NORMAL FORM-LECTUR 54
GRIEBACH NORMAL FORM -LECTURE 55
GREIBACH NORMAL FORM-LECTURE 56
LEFT MOST AND RIGHT MOST DERIVATIONS-LECTURE 57
AMBIGUITY IN CONTEXT FREE GRAMMAR-LECTURE 58
FINITE AUTOMATA TO RIGHT LINEAR GRAMMAR-LECTURE 59
FINITE AUTOMATA TO LEFT LINEAR GRAMMAR-LECTURE 60
REGULAR GRAMMAR TO FINITE AUTOMATA-LECTURE 61
CLOSURE PROPERTIES OF CFLs-LECTURE 62
REGULAR GRAMMAR AND CONTEXT FREE GRAMMAR-LECTURE - 63
PUMPING LEMMA FOR CONTEXT FREE LANGUAGES-LECTURE 64
LEFT RECURSION AND LEFT FACTORING-
LECTURE 65
LR(0) GRAMMAR-LECTURE 66
INTRODUCTION TO PUSHDOWN AUTOMATA-LECTURE 67
CONSTRUCTION OF PUSH DOWN AUTOMATA-1-LECTURE 68
CONSTRUCTION OF PUSH DOWN AUTOMATA -2- LECTURE 69
CONSTRUCTION OF PUSHDOWN AUTOMATA-3-LECTURE 70
PDA FOR BALANCED PARENTHESIS-LECTURE 71
PDA FOR na(w)>nb(w)-LECTURE 72
PDA FOR na(w)<nb(w)-LECTURE 73
PDA FOR X=XR LECTURE 74
NPDA for WWR LECTURE 75
CFG to PDA -LECTURE 76
CFG to PDA-2-LECTURE 77
CFG to PDA-3-LECTURE 78
CFG to PDA-4-LECTURE 79
CFG to PDA-5-LECTURE 80
PDA to CFG-LECTURE 81
TURING MACHINE-LECTURE 82
TURING MACHINE -EXAMPLE-LECTURE 83
TURING MACHINE EXAMPLE-LECTURE 84
Turing Machine Example-LECTURE 85
Turing Machine for 2's complement-LECTURE 86
Turing Machine for Palindrome-LECTURE 87
Turing Machine Example-LECTURE 88
TURING RECOGNIZABLE LANGUAGES-LECTURE 89
Properties of Recursive and Enumerable Languages-LECTURE 90
Closure Properties various Languages-
LECTURE 91
Post Corresponding Problem-Part1-LECTURE 92
Post Corresponding Problem-Part2-LECTURE 93
Post Corresponding Problem-Part3-LECTURE 94
UNIVERSAL TURING MACHINE(UTM)-LECTURE 95
The classes P and NP-LECTURE 96
NP hard and NP-Complete classes-LECTURE 97
Decidable and Undecidable Problems-
LECTURE 98
Variants of Turing Machines-1-LECTURE 99
Variants of Turing Machine-LECTURE 100
Variants of Turing Machine-3-LECTURE101
Equivalence of Nondeterministic and Deterministic Turing Machine-1-LEC-102
Equivalence of Nondeterministic and Deterministic Turing Machine-1 LEC-103
CHURCH-TURING THESIS-LECTURE 104
LINEAR BOUNDED AUTOMATA -LECTURE 105