UNIT Chapt Estimated No.

of
S.NO TOPICS TO BE COVERED No. of Periods
No er
Periods Taken
1 Introduction to Finite Automata 2
2 Structural Representations 1
INTRODUCTION TO FINITE 3 Automata and Complexity 1
4 the Central Concepts of Automata Theory 2
5 Alphabets 1
AUTOMATA

6 Languages 1
UNIT-I

7 Problems 2
8 Deterministic Finite Automata 1
9 Nondeterministic Finite Automata 1
10 an application 1
11 Text Search 2
12 Finite Automata with Epsilon 1
13 Transitions 1
14 Regular Expressions 1
REGULAR EXPRESSIONS

15 Finite Automata and Regular Expressions 1

16 Applications of Regular Expressions 1
17 Algebraic Laws for Regular Expressions 1
UNIT-II

18 Properties of Regular Languages 1

19 Pumping Lemma for Regular Languages 1
20 Applications of the Pumping Lemma 1
21 Closure Properties of Regular Languages 1
22 Decision Properties of Regular Languages 1
23 Equivalence and Minimization of 1
24 Automata
Context - Free Grammars 1
25 Definition of Context-Free Grammars 1
CONTEXT - FREE GRAMMARS:

26 Derivations Using a Grammar 1

27 Leftmost and Rightmost Derivations 1
28 the Language of a Grammar 1
29 Sentential Forms 1
UNIT-III

30 Parse Tress 1
31 Applications of Context-Free Grammars 2
32 Ambiguity in Grammars and Languages 1
33 Push Down Automata 1
34 Definition of the Pushdown Automaton 1
35 the Languages of a PDA 1
36 Equivalence of PDA's and CFG's 1
37 Deterministic Pushdown Automata 1
38 Normal Forms for Context 1
NORMAL
UNIT-IV

FORMS

39 Free Grammars 2
40 the Pumping Lemma for Context-Free 1
41 Languages
Free Languages 1
 42 ClosureProperties of Context-Free 1
43 Decision Properties of CFL's 1

FOR CONTEXT- FREE

44 Complexity of Converting among CFG's 1
45 Running time of conversions to Chomsky 1

GRAMMARS
46 Introduction to Turing Machines 1
47 Problems That Computers Cannot Solve 1
48 The Turing Machine 1
49 Programming Techniques for Turing 1
50 Extensions to the basic Turing machine 1
51 Restricted Turing Machines 1
52 Turing Machines, and Computers 1
53 Undecidability 1
54 A Language that is Not Recursively 1
UNDECIDABILITY

55 An Undecidable Problem That is RE 1

56 UndecidableProblems about Turing 1
UNIT-V

57 Post's Correspondence Problem 1

58 Other Undecidable Problems 1
59 Intractable Problems 1
60 The Classes P and NP 1
61 An NP-Complete Problem 1
TOTAL