FORMAL LANGUAGES AND AUTOMATA THEORY
Syllabus
First Internal examination Database
Assignment 1
Assignment 2
UNIT--1 Lecture Notes
Introduction
DFA and NFA
Conversion of NFA To DFA
Conversion of NFA with Epsilon moves to NFA without epsilon moves
Minimization of DFA
Moore and Mealy Machines
UNIT--2 Lecture Notes
Regular Expressions
RE to NFA with Epsilon moves
DFA to RE
Pumping Lemma
Closure Properties
UNIT--3
CFG Introduction
Derivations
Simplification of CFG
Normal Forms CNF & GNF
UNIT--4
PDA Design
Equivalence of PDA and CFG
UNIT--5
Design of Turing Machines
Proper subtraction OR MONUS TM
Multiplication TM : PDF
Types of TM, PCP, Church Thesis : PDF
Halting Problem of TM
UTM
Decidable and Undecidable
Introductio to P & NP