THEORY OF COMPUTATION LTPC

cS3452
3 0 0 3
cOURSE OBJECTIVES:
To understand foundations of computation including
automata theory
and languages.
To construct models of regular expressions
down automata
To design context free grammar and push
To understand Turing machines and their capability
To understand Undecidability and NP class problems

AUTOMATA AND REGULAR EXPRESsIONS 9

UNIT
Finite Automata (FA) Deterministic Finite
Need for automata theory Introduction to formal proof
-

Automata (DFA) Non-deterministic Finite Automata (NFA)

-
Equivalence between NFA and DFA
-

with and
with Epsilon transitions-Equivalence of NFA and DFA- Equivalence of NFAs
Finite Automata
without e-moves- Conversion of NFA into DFA- Minimization of DFAs.

REGULAR EXPRESSIONS AND LANGUAGES 9

UNIT I
regular expressions
Regular expression -Regular Languages- Equivalence of Finite Automata and
Proving languages to be not regular (Pumping Lemma) Closure properties regular languages.
of
-

UNIT I1 CONTEXT FREE GRAMMAR AND PUSH DOWN AUTOMATA

Types ofGrammar-Chomsky's hierarchy of languages -Context-Free Grammar (CFG)
and Languagess
-Derivations and Parse trees-Ambiguity in grammars and languages- Push Down Automata (PDA):
of
Definition -Moves Instantaneous descriptions -Languages of pushdown automata-Equivalence
Pushdown Automata.
pushdown automata and CFG-CFG to PDA-PDA to CFG-Deterministic

9
UNIT IV NORMAL FORMS AND TURING MACHINES
Form (CNF) and Greibach Normal
Normal forms for CFG Simplification of CFG- Chomsky Normal
Context Free Languages -Turing
Form (GNF) Pumping lemma for CFL Closure properties of
-

Machine: Basic model - definition and representation

-Instantaneous Description Language -

functions Programming techniques for Turing

acceptance by TM- TM as Computer of Integer
machines (subroutines).

UNDECIDABILITY
9
UNIT V
Recursive and recursively enumerable
Unsolvable Problems and Computable Functions-PCP-MPCP-
and Intractable problems P and NP
languages Properties Universal Turing machine -Tractable
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
C04: Design Turing machine for computational functions
cO5: Differentiate between decidable and undecidable problems
TOTAL:45 PERIODs

73