Scribd
Upload
181 views

THeory of Computation Syllabus

This syllabus outlines a course on Theory of Computation that will cover automata theory, formal languages, Turing machines, and computational complexity over 45 hours. The course objectives are to provide a basic understanding of these topics. It will introduce topics like finite automata, context-free grammars, pushdown automata, Turing machines, undecidability, and complexity classes. Evaluation will be based on exam questions covering all chapters, with marks distributed based on time spent on each topic.

Uploaded by

BineilKcThapa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
181 views

THeory of Computation Syllabus

This syllabus outlines a course on Theory of Computation that will cover automata theory, formal languages, Turing machines, and computational complexity over 45 hours. The course objectives are to provide a basic understanding of these topics. It will introduce topics like finite automata, context-free grammars, pushdown automata, Turing machines, undecidability, and complexity classes. Evaluation will be based on exam questions covering all chapters, with marks distributed based on time spent on each topic.

Uploaded by

BineilKcThapa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

THEORY OF COMPUTATION | SYLLABUS | IOE | SECOND YEAR

THEORY OF COMPUTATION

CT 502
Lecture : 3
year : II
Tutorial : 1
Part : I
Practical : 0

Course Objectives:
To provide basic understanding of theory of automata, formal
languages, turing machines and computational complexity.

1. Introduction (4 hours)
1.1 Set, relation, function, Proof techniques.
1.2 Alphabets, language, regular expression.

2. Finite Automata (12 hours)
2.1 Deterministic Finite Automata.
2.2 Non-Deterministic Finite Automata.
2.3 Equivalence of regular language and finite automata.
2.4 Regular language, properties of regular language.
2.5 Pumping lemma for regular language.
2.6 Decision algorithms for regular languages.



3. Context free language (12 hours)
3.1 Context free grammar.
3.2 Derivative trees, simplification of context free grammar.
3.3 Chomsky normal form.
3.4 Push down automata.
3.5 Equivalence of context free language and push down automata.
3.6 Pumping lemma for context free language.
3.7 Properties of context free language.
3.8 Decision algorithms for context free language.

4. Turing machine (10 hours)
4.1 Definition of Turing machine, notation for Turing machine.
4.2 Computing with Turing machine.
4.3 Extensions of Turing machine.
4.4 Unrestricted grammar.
4.5 Recursive function theory.


5. Undecidability (5 hours)
5.1 The Church-Turing thesis.
5.2 Halting Problem, Universal Turing machine.
5.3 Undecidable problems about Turing machines, grammars.
5.4 Properties of Recursive, Recursively enumerable languages.

6. Computational Complexity (2 hours)
6.1 Class P, Class NP, NP-complete problems.

References
1. H. R. Lewis, C. H. Papadimitriou, Elements of theory of
computation, Pearson Education.
2. Michael Sipser, Introduction to the Theory of Computation,
Thomson Course Technology.

Evaluation Scheme
The questions will cover all the chapters of syllabus. The
evaluation scheme will be as indicated in the table below:
Chapters Hours Marks distribution*
Chapters Hours Marks distribution*
1 4 7
2 12 21
3 12 21
4 10 17
5 5 9
6 2 5
Total 45 80

* There could be a minor deviation in the marks distribution.

You might also like