Term Paper

Section: Course Code: CSE321

Date of Allocation: Date of Submission:

Sr. No Domain Area Roll No Out comes of Signature

term paper
1 Deterministic Pushdown 1, 36
Automata (DPDA)
Pumping lemma for 2, 37
2 grammars
Regular Grammars and 3, 38
3 Regular sets
Regular and Non Regular 4, 39
4 Languages
Ambiguity and Membership 5, 40
5 algorithms in Context-Free
Grammars
Push Down Automata and 6, 41
6 Context-Free languages
Closure properties and 7, 42
7 Decision Algorithms for
Context-Free Grammars
Post Machines 8, 43
8
2-stack Push Down 9, 44
9 Automata and Minsky’s
theorem
Variations on Turing 10, 45
10 Machines
Turing Machines 11, 46
11 Languages
Chomsky Hierarchy 12, 47
12
Computable Functions 13, 48
13
Church’s Thesis 14, 49
14
Turing Machines as 15, 50
15 language Generator
16, 51
Phase structured grammars
16
17 17, 52
P and NP complete problem
 Students would be able to discover about automata theory design techniques & various parts of automatic systems to build a
18 18, 53
Multi Track Turing
Machine
19 19, 54
The Model of Linear
Bounded Automata
20,55
Halting problem of Turing
20 Machine
21, 56
Post correspondence
21 problem and decidability
Cellular Automata 22, 57
22
Parse Trees 23, 58
23

language which is accepted in computer science field.

Compare & contrast the 24, 59
24 Formal Languages &
Cellular Automata
Equivalence of Turing 25, 60
25 Machine & Two stack PDA
Canonical Derivations 26, 61
26
27 Different methods to 27, 62
reduction of a Languages
28 Syntax Analysis 28, 63
29 Different categories of 29, 64
Parsing Algorithm
30 Compare the DPDA's and 30, 65
Context-Free Languages
31 Finite automata and 31, 66
decision problems
32 Chomsky Classifications of 32, 67
Languages
33 Compare the DPDA's and 33, 68
Regular Languages
34 Construction of PDA 34, 69
equivalent of a CFG
35 Compare the DPDA's and 35,70
Ambiguous Grammars