Session

Session Name
S No Unit No Regd. Topic Nos Topics
(Content Broad Name)
No.

1 1 S1 Introduction L1 Fundamentals of automata

Definition,Model of computation,serial models,parallel

2 1 S2 Computation L2,L3,L4,L5,L6,L7 models,Abstraction and Abstract machine,Finite State
machine
L8,L9,L10,L11,L12 State, Transition,state diagram,state transition table,state
3 1 S3 Elements of finite state system
,L13 diagram transition table,
Mathematical representation
4 1 S4 L14 Ordered Quintuple specification of Finite Automata
of finite state machine
Based on Modeling ,Based on implementation,Based on
L15,L16,L17,L18, processing,Based on the input,Based on
5 1 S5 Automata classification
L19,L20,L21 applications,Advantages of FSM,DIsadvantages of
FSM,Applications of FSM
6 2 S6 Finite automaton model L22 DFA And NFA
Acceptance of strings and
7 2 S7 L23 Acceptance of strings and languages with example
languages
8 2 S8 Equivalence of NFA and DFA L24 Definition,Examples
9 2 S9 NFA to DFA conversion L25 NFA to DFA Conversion Procedure with examples
Equivalence of NFA with ϵ
10 2 S10 L26 Definition,Examples
moves
Minimization of finite
11 2 S11 L27 Myhill- Nerode theorem
automata
Equivalence between two
12 2 S12 L28 Definition,Examples
DFA’s
13 2 S13 Finite automata with output L29 Moore and Mealy machines
Equivalence between Moore
14 3 S14 L30 Definition,Examples
and Mealy machines
conversion of Moore to Mealy
15 3 S15 L31 procedure to convert mealy to moore and vice versa
and Mealy to Moore.
Introduction To CFG,Languages and operations,Derivations
L31,L32,L34,L35,
16 3 S16 CFG Of Trees And Ambiguity, Unambiguous CFG And Algebric
L36
Expressions
Normal Forms and Simplified
17 3 S17 L37 Chomsky normal form,Examples
Forms
Chomsky normal
18 3 S18 L38 Example
form,Examples
19 3 S19 GNF L39 Greibach normal form,Examples
20 4 S20 GNF L40 Example
21 4 S21 Pumping lemma L41 Definition
Pumping lemma for context procedure with Examples,Properties of CFL ,Applications
22 4 S22 L42,L43,L44
free languages of CFL
23 4 S23 Pumping lemma L45 Example
24 4 S24 Introduction To PDA L46 Definition,Example,DPDA
25 4 S25 PDA Corresponding To CFG L47 PDA to CFG
26 4 S26 PDA Corresponding To CFG L48 Examples
27 4 S27 CFG Corresponding To PDA L49 CFG to PDA
28 5 S28 CFG Corresponding To PDA L50 Examples
29 5 S29 Introduction To CFL L51 Introduction To CFL
Intersections And
30 5 S30 L52 Intersections And Complements Of CFL
Complements Of CFL
 Session
Session Name
S No Unit No Regd. Topic Nos Topics
(Content Broad Name)
No.

31 5 S31 Decisions Problems And CFL. L53 Decisions Problems And CFL.
32 5 S32 Turing machine L54 Introduction,Definition
33 5 S33 Recursive language L55 Definition,Closure properites,Example
Model Of Computation And
34 5 S34 L56 Model Of Computation And Church Turning Thesis
Church Turning Thesis
35 5 S35 Languages accepted by a TM L57 Languages accepted by a TM
36 5 S36 Variations Of Tm L58 Non Deterministic Tm, Universal Tm
37 5 S37 Enumerable And Language L59 Definition
Recursive And Non Recursive
38 6 S38 L60 Definition,Closure properites,Example
Enumerable
39 6 S39 LR(0) grammar L61 Precedure and Example
Decidable and un-decidable
40 6 S40 L62 Decidable and un-decidable problems
problems
41 6 S41 P and NP Problems L63 P and NP Problems
42 6 S42 Universal Turing machine L64 Universal Turing machine
Halting problem of a Turing
43 6 S43 L65 Halting problem of a Turing machine
machine
Un-decidability of post’s
correspondence problem and Definition of post’s correspondence problem and modified
44 6 S44 L66
modified post’s post’s correspondence problem
correspondence problem.
45 6 S45 PCP L67 PCP Examples
Topic Reg. Topic Topic sub
Topic Code Topic Name
No Category Category

Basic Engg- Techniques and

T1 A0517.1 Fundamentals of automata
Computers Tools
Basic Engg- Techniques and
T2 A0517.2 Theory of Computation
Computers Tools
Basic Engg- Techniques and
T3 A0517.3 Model of computation
Computers Tools
Basic Engg- Techniques and
T4 A0517.4
serial models Computers Tools
Basic Engg- Techniques and
T5 A0517.5 parallel models
Computers Tools
Basic Engg- Techniques and
T6 A0517.6
Abstraction and Abstract machine Computers Tools
Basic Engg- Techniques and
T7 A0517.7
Finite State machine Computers Tools
Basic Engg- Techniques and
T8 A0517.8
State Computers Tools
Basic Engg- Techniques and
T9 A0517.9
Transition Computers Tools
Basic Engg- Techniques and
T10 A0517.10
state diagram Computers Tools
Basic Engg- Techniques and
T11 A0517.11
state transition table Computers Tools
Basic Engg- Techniques and
T12 A0517.12
state diagram Computers Tools
Basic Engg- Techniques and
T13 A0517.13
transition table Computers Tools
Basic Engg- Techniques and
T14 A0517.14 Ordered Quintuple specification of Finite Automata
Computers Tools
Basic Engg- Techniques and
T15 A0517.15
Based on Modeling Computers Tools
Basic Engg- Techniques and
T16 A0517.16 Based on implementation
Computers Tools
Basic Engg- Techniques and
T17 A0517.17
Based on processing Computers Tools
Basic Engg- Techniques and
T18 A0517.18
Based on the input Computers Tools
Basic Engg- Techniques and
T19 A0517.19
Based on applications Computers Tools
Basic Engg- Techniques and
T20 A0517.20
Advantages of FSM Computers Tools
Basic Engg- Techniques and
T21 A0517.21
DIsadvantages of FSM Computers Tools
Topic Reg. Topic Topic sub
Topic Code Topic Name
No Category Category

Basic Engg- Techniques and

T22 A0517.22 Applications of FSM
Computers Tools
Basic Engg- Techniques and
T23 A0517.23 DFA And NFA
Computers Tools
Basic Engg- Techniques and
T24 A0517.24 Acceptance of strings and languages with example
Computers Tools
Basic Engg- Techniques and
T25 A0517.25 Definition,Examples
Computers Tools
Basic Engg- Techniques and
T26 A0517.26 NFA to DFA Conversion Procedure with examples
Computers Tools
Basic Engg- Techniques and
T27 A0517.27 Definition,Examples
Computers Tools
Basic Engg- Techniques and
T28 A0517.28 Myhill- Nerode theorem
Computers Tools
Basic Engg- Techniques and
T29 A0517.29 Definition,Examples
Computers Tools
Basic Engg- Techniques and
T30 A0517.30 Moore and Mealy machines
Computers Tools
Basic Engg- Techniques and
T31 A0517.31 Definition,Examples
Computers Tools
Basic Engg- Techniques and
T32 A0517.32 procedure to convert mealy to moore and vice versa
Computers Tools
Basic Engg- Techniques and
T33 A0517.33
Introduction To CFG Computers Tools
Basic Engg- Techniques and
T34 A0517.34
Languages and operations Computers Tools
Basic Engg- Techniques and
T35 A0517.35
Derivations Of Trees And Ambiguity Computers Tools
Basic Engg- Techniques and
T36 A0517.36
Unambiguous CFG And Algebric Expressions Computers Tools
Basic Engg- Techniques and
T37 A0517.37 Chomsky normal form,Examples
Computers Tools
Basic Engg- Techniques and
T38 A0517.38 Example
Computers Tools
Basic Engg- Techniques and
T39 A0517.39 Greibach normal form,Examples
Computers Tools
Basic Engg- Techniques and
T40 A0517.40 Example
Computers Tools
Basic Engg- Techniques and
T41 A0517.41 Definition
Computers Tools
Basic Engg- Techniques and
T42 A0517.42
procedure with Examples Computers Tools
Basic Engg- Techniques and
T43 A0517.43
Properties of CFL Computers Tools
Topic Reg. Topic Topic sub
Topic Code Topic Name
No Category Category

Basic Engg- Techniques and

T44 A0517.44
Applications of CFL Computers Tools
Basic Engg- Techniques and
T45 A0517.45 Example
Computers Tools
Basic Engg- Techniques and
T46 A0517.46 Definition,Example,DPDA
Computers Tools
Basic Engg- Techniques and
T47 A0517.47 PDA to CFG
Computers Tools
Basic Engg- Techniques and
T48 A0517.48 Examples
Computers Tools
Basic Engg- Techniques and
T49 A0517.49 CFG to PDA
Computers Tools
Basic Engg- Techniques and
T50 A0517.50 Examples
Computers Tools
Basic Engg- Techniques and
T51 A0517.51 Introduction To CFL
Computers Tools
Basic Engg- Techniques and
T52 A0517.52 Intersections And Complements Of CFL
Computers Tools
Basic Engg- Techniques and
T53 A0517.53 Decisions Problems And CFL.
Computers Tools
Basic Engg- Techniques and
T54 A0517.54 Introduction,Definition
Computers Tools
Basic Engg- Techniques and
T55 A0517.55 Definition,Closure properites,Example
Computers Tools
Basic Engg- Techniques and
T56 A0517.56 Model Of Computation And Church Turning Thesis
Computers Tools
Basic Engg- Techniques and
T57 A0517.57 Languages accepted by a TM
Computers Tools
Basic Engg- Techniques and
T58 A0517.58 Non Deterministic Tm, Universal Tm
Computers Tools
Basic Engg- Techniques and
T59 A0517.59 Definition
Computers Tools
Basic Engg- Techniques and
T60 A0517.60 Definition,Closure properites,Example
Computers Tools
Basic Engg- Techniques and
T61 A0517.61 Precedure and Example
Computers Tools
Basic Engg- Techniques and
T62 A0517.62 Decidable and un-decidable problems
Computers Tools
Basic Engg- Techniques and
T63 A0517.63 P and NP Problems
Computers Tools
Basic Engg- Techniques and
T64 A0517.64 Universal Turing machine
Computers Tools
Basic Engg- Techniques and
T65 A0517.65 Halting problem of a Turing machine
Computers Tools
Topic Reg. Topic Topic sub
Topic Code Topic Name
No Category Category

Definition of post’s correspondence problem and Basic Engg- Techniques and

T66 A0517.66
modified post’s correspondence problem Computers Tools
Basic Engg- Techniques and
T67 A0517.67 PCP Examples
Computers Tools