Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
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