Scribd
Upload
22 views2 pages

Syllabus

The document outlines the course objectives and structure for CS3452 Theory of Computation, covering topics such as automata theory, regular expressions, context-free grammar, Turing machines, and undecidability. It details five units of study, each focusing on different aspects of computation theory, and lists expected course outcomes for students. Additionally, it provides references and textbooks for further reading.

Uploaded by

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

Syllabus

The document outlines the course objectives and structure for CS3452 Theory of Computation, covering topics such as automata theory, regular expressions, context-free grammar, Turing machines, and undecidability. It details five units of study, each focusing on different aspects of computation theory, and lists expected course outcomes for students. Additionally, it provides references and textbooks for further reading.

Uploaded by

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

CS3452 THEORY OF COMPUTATION LTPC

3 003
COURSE OBJECTIVES:
 To understand foundations of computation including automata theory
 To construct models of regular expressions and languages.
 To design context free grammar and push down automata
 To understand Turing machines and their capability
 To understand Undesidability and NP class problems

UNIT I AUTOMATA AND REGULAR EXPRESSIONS 9


Need for automata theory - Introduction to formal proof – Finite Automata (FA) – Deterministic
Finite Automata (DFA) – Non-deterministic Finite Automata (NFA) – Equivalence between NFA
and DFA – Finite Automata with Epsilon transitions – Equivalence of NFA and DFA- Equivalence
of NFAs with and without ε-moves- Conversion of NFA into DFA – Minimization of DFAs.
UNIT II REGULAR EXPRESSIONS AND LANGUAGES 9
Regular expression – Regular Languages- Equivalence of Finite Automata and regular expressions
– Proving languages to be not regular (Pumping Lemma) – Closure properties of regular languages.
UNIT III CONTEXT FREE GRAMMAR AND PUSH DOWN AUTOMATA 9
Types of Grammar - Chomsky‘s hierarchy of languages -Context-Free Grammar (CFG) and
Languages – Derivations and Parse trees – Ambiguity in grammars and languages – Push Down
Automata (PDA): Definition – Moves - Instantaneous descriptions -Languages of pushdown
automata – Equivalence of pushdown automata and CFG-CFG to PDA-PDA to CFG –
Deterministic Pushdown Automata.
UNIT IV NORMAL FORMS AND TURING MACHINES 9
Normal forms for CFG – Simplification of CFG- Chomsky Normal Form (CNF) and Greibach
Normal Form(GNF)–PumpinglemmaforCFL–ClosurepropertiesofContextFreeLanguages –Turing
Machine : Basic model – definition and representation – Instantaneous Description – Language
acceptance by TM – TM as Computer of Integer functions – Programming techniques for Turing
machines (subroutines).
UNIT V UNDECIDABILITY 9
Unsolvable Problems and Computable Functions –PCP-MPCP- Recursive and recursively
enumerable languages – Properties - Universal Turing machine -Tractable and Intractable problems
- P and NP completeness – Kruskal’s algorithm – Travelling Salesman Problem- 3- CNF SAT
problems.
COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO1: Construct automata theory using Finite Automata
CO2: Write regular expressions for any pattern
CO3: Design context free grammar and Pushdown Automata
CO4: Design Turing machine for computational functions
CO5: Differentiate between decidable and undecidable problems

TOTAL: 45 PERIODS
TEXT BOOKS:
1. Hopcroft J.E., Motwani R. & Ullman J.D., "Introduction to Automata Theory, Languages and
Computations", 3rd Edition, Pearson Education, 2008.
2. JohnCMartin,"IntroductiontoLanguagesandtheTheoryofComputation",4 th Edition, Tata
McGraw Hill, 2011.

REFERENCES:
1. HarryRLewisandChristosHPapadimitriou,"ElementsoftheTheoryofComputation",2 nd
Edition, Prentice Hall of India, 2015.
2. Peter Linz ,"An Introduction to Formal Language and Automata",6th Edition , Jones&
Bartlett, 2016.
3. K.L.P. Mishra and N.Chandrasekaran, “Theory of Computer Science: Automata
Languages and Computation”, 3rd Edition, Prentice Hall of India, 2006.

PO’S PSO’S
CO’s 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 1 3 2 3 - - - - 1 1 2 3 1 3 2
2 2 2 3 2 1 - - - 3 3 2 3 3 1 2
3 2 2 3 2 1 - - - 1 3 1 2 1 2 2
4 2 2 2 1 - - - - 1 3 3 2 1 3 2
5 2 2 2 1 1 - - - 1 1 3 2 3 1 3
AVg. 2 2 2 2 1 - - - 1 2 2 2 2 2 2

1 - low, 2 - medium, 3 - high, ‘-“- no correlation

You might also like