CS2303 THEORY OF COMPUTATION L T P C

3 1 0 4
UNIT I AUTOMATA 9
Introduction to formal proof Additional forms of proof Inductive proofs Finite Automata (FA)
Deterministic Finite Automata (DFA) Non-deterministic Finite Automata (NFA) Finite Automata
with Epsilon transitions.
UNIT II REGULAR EXPRESSIONS AND LANGUAGES 9
Reular E!pression FA and Reular E!pressions "rovin lanuaes not to #e reular $losure
properties of reular lanuaes E%uivalence and minimi&ation of Automata.
UNIT III CONTEXT-FREE GRAMMARS AND LANGUAGES 9
$onte!t-Free 'rammar ($F') "arse (rees Am#iuit) in rammars and lanuaes Definition
of the "ushdown automata *anuaes of a "ushdown Automata E%uivalence of "ushdown
automata and $F' Deterministic "ushdown Automata.
UNIT IV PROPERTIES OF CONTEXT-FREE LANGUAGES 9
Normal forms for $F' "umpin *emma for $F* $losure "roperties of $F* (urin +achines
"rorammin (echni%ues for (+.
UNIT V UNDECIDABALITY 9
A lanuae that is not Recursivel) Enumera#le (RE) An undecida#le pro#lem that is RE
,ndecida#le pro#lems a#out (urin +achine "ost-s $orrespondence "ro#lem (he classes "
and N".
L: 45 T: 15 TOTAL: !0 PERIODS
TEXT BOO":
.. /.E. 0opcroft1 R. +otwani and /.D. ,llman1 2Introduction to Automata (heor)1 *anuaes and
$omputations31 second Edition1 "earson Education1 4556.
REFERENCES:
.. 0.R. *ewis and $.0. "apadimitriou1 2Elements of the theor) of $omputation317econd Edition1
"earson Education1 4558.
4. (homas A. 7ud9amp13 An Introduction to the (heor) of $omputer 7cience1 *anuaes and
+achines31 (hird Edition1 "earson Education1 4556.
8. Ra)mond 'reenlaw an 0./ames 0oover1 2 Fundamentals of (heor) of $omputation1 "rinciples
and "ractice31 +oran :aufmann "u#lishers1 .;;<.
=. +icheal 7ipser1 2Introduction of the (heor) and $omputation31 (homson >ro9ecole1 .;;6.
?. /. +artin1 2Introduction to *anuaes and the (heor) of computation3 (hird Edition1 (ata +c
'raw 0ill1 4556