FORMAL LANGUAGES AND AUTOMATA THEORY
3/4 CSE B17CS3103
ONLINE RESOURCES - UNIT--I
FORMAL LANGUAGES AND AUTOMATA THEORY
3/4 CSE B17CS3103
ONLINE RESOURCES - UNIT--I
Introduction Lecture Notes PPT Video by KVSM video by BNR
Design of DFA and NFA Lecture Notes PPT Video by KVSM video by BNR
Equivalence of NFA and DFA Lecture Notes PPT Video by Bnr
NFA with Epsilon Transitions Lecture Notes PPT Video Lecture
Mealy and Moore Machines Lecture Notes PPT1
Equivalence of Mealy & Moore PPT2 Video Lecture
Minimization of Finite Automata Lecture Notes PPT Video Lecture
Regular Expressions Lecture notes PPT video lecture
RE to NFA with Epsilons Lecture notes PPT video lecture
DFA to Regular expressions Lecture notes PPT video lecture
Arden's theorem Lecture notes PPT video lecture
Pumping Lemma on Regular languages Lecture notes PPT video lecture
Closure properties Lecture notes PPT video lecture
Context free grammars Lecture notes PPT video lecture
Derivations & Parse trees Lecture notes PPT video lecture
Simplification of CFG Lecture notes PPT video lecture
Normal forms in CFG Lecture notes PPT video lecture
Pumping Lemma on CFL Lecture notes PPT video lecture
Closure properties & applications of CFG Lecture notes PPT video lecture
Question bank from unit 3
Introduction and PDA Design Lecture notes & PPT video lecture
Equivalence of PDA and CFG Lecture notes & PPT video lecture
Question bank from unit 4
Introduction and Design of TM Lecture notes & PPT video lecture
PCP Lecture notes & PPT video lecture
Question bank from unit 4
Department of CSE
S R K R ENGINEERING COLLEGE