LECTURE NO.

TOPICS
1 Introduction
2 Mathematical Preliminaries and Notations
3 Basic Concepts
4 Applications
5 Deterministic Finite Acceptors
6 Non Deterministic Finite Acceptors

7 Equivalence of Deterministic and Non Deterministic Acceptors

8 Reduction of the number of states in Finite Automata

9 Regular Expressions

10 Connection between Regular expressions an regular languages

11 Regular Grammars
12 Properties of Regular Languages
13 Properties of Regular Languages
14 Context-free Grammars
15 Parsing and ambiguity – Parsing and Membership
16 Context-Free grammars – Programming
17 Methods for transforming Grammars
18 Important Normal Forms
19 Important Normal Forms
20 Membership algorithm for Context – free Grammars
21 Non deterministic Pushdown Automata.
22 Non deterministic Pushdown Automata.
23 Pushdown Automata and context Free Languages
24 Deterministic Pushdown Automata and
25 Deterministic Context Free Languages
26 Grammars for Deterministic Context free languages
27 Two Pumping Lemmas
Closure Properties and Decision Algorithms for Context-Free
28 Languages
29 The Standard Turing machine
30 Combining Turing machine for complicated task
31 Turing thesis
32 Minor Variations on Turing Machine Theme
33 Turing Machine with More complex Storage
34 Nondeterministic Turing Machines
35 A Universal Turing Machine
36 Linear Bounded Automata
37 Recursive and Recursively Enumerable Languages
38 Unrestricted Grammar
39 Context Sensitive Grammars and Languages
40 The Chomsky Hierarchy
41 Efficiency of Computation
42 Turing Machines and Complexity
43 Language family and Complexity Class

44 The Complexity Classes P and NP

45 QA
46 Examination
47 Co-Curricular Activities
48 Extra Curricular Activities
note: Every cell must have one topic. Kindly ignore
ex:17-21 Should not be combined like this. If topic
same for more than one hour then it can be
duplicated