Scribd
Upload
35 views

CS3452-THEORY-OF-COMPUTATION-SYLLABUS

The syllabus for CS3452 Theory of Computation outlines the course objectives, including understanding automata theory, regular expressions, context-free grammar, Turing machines, and undecidability. It is divided into five units covering topics such as finite automata, regular languages, pushdown automata, normal forms, and unsolvable problems. By the end of the course, students will be able to construct automata, write regular expressions, design grammars and Turing machines, and differentiate between decidable and undecidable problems.

Uploaded by

praneeshprathiksha
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
35 views

CS3452-THEORY-OF-COMPUTATION-SYLLABUS

The syllabus for CS3452 Theory of Computation outlines the course objectives, including understanding automata theory, regular expressions, context-free grammar, Turing machines, and undecidability. It is divided into five units covering topics such as finite automata, regular languages, pushdown automata, normal forms, and unsolvable problems. By the end of the course, students will be able to construct automata, write regular expressions, design grammars and Turing machines, and differentiate between decidable and undecidable problems.

Uploaded by

praneeshprathiksha
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/ 1

SYLLABUS

CS3452 THEORY OF COMPUTATION LTPC


300 3
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 Undecidability 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) – Pumping lemma for CFL – Closure properties of Context Free Languages –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.

OUTCOMES:
At the end of this course, the students will be able to:
C211.1: Construct automata theory using Finite Automata
C211.2: Write regular expressions for any pattern
C211.3: Design context free grammar and Pushdown Automata
C211.4: Design Turing machine for computational functions
C211.5: Differentiate between decidable and undecidable problems

TOTAL:45 PERIODS

You might also like