Annexure : 02

SUNDER DEEP GROUP OF INSTITUTIONS, Ghaziabad

No of
Text Book /
S.no Topic Coverd Lectures
Reference Book
Required
Unit - I
1 Alphabets, Strings and Languages; Automata and Grammars 1 T1
2 Deterministic finite Automata (DFA)-Formal Definition, Simplified notation 1 T1/R1
3 State transition graph, Transition table, Language of DFA 2 T1/R2
4 Nondeterministic finite Automata (NFA), NFA with epsilon transition 2 T1
5 Language of NFA, Equivalence of NFA and DFA 2 T1
6 Minimization of Finite Automata 1 T2
7 Distinguishing one string from other, Myhill-Nerode Theorem 2 T1/T2
Total 11
Unit - II
1 Regular expression (RE) , Definition, Operators of regular expression and their precedence 2 T1/T2
2 Algebraic laws for Regular expressions, Kleen’s Theorem 1 T1/R2
3 Regular expression to FA, DFA to Regular expression 2 T1/T2
4 Arden Theorem, Non Regular Languages 2 T2
5 Pumping Lemma for regular Languages. Application of Pumping Lemma 1 T1/T2
6 Closure properties of Regular Languages, Decision properties of Regular Languages 2 T1/T2
7 FA with output: Moore and Mealy machine 2 T1/T2
8 Equivalence of Moore and Mealy Machine, Applications and Limitation of FA 1
Total 13
Unit - III
1 Definition, Examples, Derivation , Derivation trees 2 T2/R1
2 Ambiguity in Grammer, Inherent ambiguity, Ambiguous to Unambiguous CFG 2 T2/R2
3 Useless symbols, Simplification of CFGs 3 T2/T1
4 Normal
Closure forms for CFGs:
properties CNF and GNFFiniteness and Memership, Pumping lemma for
of CFLs;Emptiness, 3 T2/R2
5 CFLs 2 T2/R1
Total 12
Unit - IV
1 Push Down Automata (PDA): Description and definition, 1 T1/T2
2 Instantaneous Description, Language of PDA, 2 T1
3 Acceptance by Final state, Acceptance by empty stack 2 T1/T2
4 Deterministic PDA, Equivalence of PDA and CFG 2 T1/R2
5 CFG to PDA and PDA to CFG, Two stack PDA 2 T1/R1
Total 9
Unit - V
1 Turing machines (TM): Basic model, definition and representation 1 T1/T2
2 Instantaneous Description, Language acceptance by TM, Variants of Turing Machine 2 T1/R2
3 TM as Computer of Integer functions, Universal TM, Church’s Thesis 2 T1/T2
4 Recursive and recursively enumerable languages, Halting problem 2 T1/R1
5 Post
Introduction to Undecidability,
correspondence Undecidable
problem (PCP), problems
Modified about TMsto recursive function
PCP, Introduction 2 T1/T2
6 theory 1 T1/T2
Total 10
Grand Total 55
Text Books:-- Reference Books:--
T1:"Theory of Automata" K.L.P. Mishra R1:Int. to Languages and Theory of Computations:Martin J. C
T2:"Introduction Automata Theory"Hopcroft, UllmanR2:Elements of the Theory of Comp. Papadimitrou, C. and Lewis, C.L

Signature of Faculty………………………… Signature of HOD……………………