Sei sulla pagina 1di 5

SRM UNIVERSITY

FACULTY OF ENGINEERING AND TECHNOLOGY


SCHOOL OF COMPUTING
DEPARTMENT OF CSE
COURSE PLAN

Course Code : CS0355


Course Title : Theory Of Computation
Semester : V
Course Time : July- Dec 2011

DAY Hour Timing


1 3 10.35-11.25
2 6 2.20-3.10
3 1 8.45-9.35
4
5 6 2.20-3.10

Location : S.R.M.E.C – Tech Park

Faculty Details

SEC NAME OFFICE OFFICE HOUR MAIL ID


IT park
CSE-SE Mr. T. Sabanayagam Mon -Fri stsabha@ktr.srmuniv.ac.in
706 ‘A’

Required Text Books:

1. J. E.Hopcroft, R.Motwani and J.D.Ullman, "Introduction to Automata Theory, Languages and


Computation", Second Edition Pearson Education, 2003Dd

Reference Books:

2. H.R. Lewis and C.H. Papadimitriou , “ Elements of the Theory of Computation”, Second Edition , Pearson
Education /PHI , 2003
3. J.Martin, “ Introduction to Languages and the Theory of Computation”, Third Edition , TMH, 2003
4. Michael Sipser, “ Introduction of the Theory and Computation “, Thomson, Brokecole, 1997
Online References:

1. http://www.cis.upenn.edu/~cis511/
2. http://en.wikipedia.org/wiki/Theory_of_computation
3. http://geisel.csl.uiuc.edu/~loui/sdcr/
4. http://www.math.niu.edu/~rusin/known-math/index/68QXX.html#INTRO

Prerequisite : MA0102, MA0211

Objectives

1. To have an understanding of finite state and pushdown automata.


2. To have a knowledge regular languages and context free languages
3. To know the relation between regular language, context free language and corresponding recognizers.
4. To study the Turing Machine and classes of problems.

Assessment Details
Cycle Test – I : 10 Marks
Surprise Test / Assignment : 05 Marks
Cycle Test – II : 10 Marks
Model Exam : 20 Marks
Attendance : 05 Marks

Test Schedule

S.No. DATE TEST TOPICS DURATION


1 Cycle Test - I Unit I & II 2 periods
2 Cycle Test - II Unit III & IV 2 periods
3 Model Exam All 5 units 3 Hrs

Outcomes

Students who have successfully completed this course will have full understanding of the following

concepts

1. Knowledge of automata and formal language theory

2. Knowledge of computability
Detailed Session Plan

AUTOMATA
Introduction to formal proof –Additional forms of proof – Inductive proofs- Finite Automata(FA) – Deterministic
Finite Automata (DFA) – Non-deterministic Finite Automata ( NDFA) - Finite Automata with € -moves
Sessio Time Teaching
Topics to be covered Ref Testing Method
n No. (min) Method

1 Preliminaries – sets, relations, functions, 50 1,3 BB


Assignment/ practical

2 Trees and graphs 50 1,3 BB


Assignment/ practical
3 50 1,3 BB
Induction Principles – Formal proof Assignment/ practical
4 50 1,3 BB
Additional forms of proofs Assignment/ practical
5 50 1,3 BB
Introduction to Finite Automata Assignment/ practical

5 Finite Automata – Basic definitions 50 1 BB Group discussion


Quiz
6 50 1 BB
DFA and its extension Assignment/ practical

7 50 1 BB
NDFA and its extension Quiz, Assignment
FA with epsilon moves
8 50 1 BB
Quiz, Assignment

9
Equivalence of DFA and NDFA 50 1,3 BB
Assignment/ practical

10 Equivalence of DFA and NDFA 50 1,3 BB


Assignment/ practical

11 Equivalence of NDFA and €- NDFA 50 1,3 BB


Assignment/ practical

12 Equivalence of NDFA and €- NDFA 50 1,3 BB


Assignment/ practical

REGULAR EXPRESSIONS AND LANGUAGES


Regular Expression - FA and regular expressions –Proving languages not to be regular- Closure properties of regular
languages- Equivalence and minimization of Automata.

13 Regular Expressions Introduction 50 1,3 BB Discussion


14 FA and Regular expressions 50 1,3 BB Illustration by examples

15 FA and Regular expressions 50 1 BB Test

16 FA and Regular expressions 50 1 BB Quiz

17 Non regular languages 50 1 BB Quiz

18 Non regular languages 50 1 BB Assignment

19 Closure properties of regular languages 50 1 BB Problem solving, surprise


test
20 Minimization of Automata 50 1 BB Problem solving, surprise
test
21 Minimization of Automata Problem solving, surprise
50 1 BB test

CONTEXT-FREE GRAMMAR ANG LANGUAGES


Context Free Grammar(CFG)- Parse Trees – Ambiguity in grammars and languages – Definition of Pushdown
Automata – Languages of Pushdown Automata- Equivalence of Pushdown Automata and CFG- Deterministic
Pushdown Automata

Grammar Introduction- Types of grammar Quiz


22 1,2 BB Group discussion

Context Free Grammar Quiz


23 50 1,2 BB
Group discussion

Parse Trees, Derivations Quiz


24 50 1 BB

25 Ambiguity in grammars 50 1 BB Surprise Test

26 Relationship between Parse trees and 50 1 BB Group discussion


Derivations
Relationship between Parse trees and Quiz
27 50 1 BB
Derivations

28 Pushdown Automata 50 1 BB Group discussion

29 Languages of Pushdown Automata 50 1 BB Test


Brain storming
30 Languages of Pushdown Automata 50 1 BB Test
Brain storming
31 Equivalence of PDA and CFG 50 1 BB Test
Problem solving,
32 Equivalence of PDA and CFG 50 1 BB Test
Problem solving,
33 Problems on PDA 50 1 BB Test
Problem solving,

PROPERTIES OF CONTEXT –FREE LANGUAGES

Normal forms of CFG- Pumping lemma for CFL – Closure Properties of CFL- Turing Machines- Programming
Techniques for TM

34 Normal Forms of CFG - CNF 50 1 BB Group discussion


Assignment
35 Normal Forms of CFG - CNF 50 1 BB Group discussion
Quiz
36 Normal Forms of CFG - GNF 50 1 BB Group discussion
Assignment
37 Pumping Lemma for CFL 50 1 BB Group discussion,
Surprise test
Closure Properties of CFL, Turing Machines Group discussion,
38 50 1 BB
Introduction Surprise test

39 Turing Machines Moves, ID 50 1 BB


Surprise test
40 Design of TM (Programming Techniques) 50 1 BB Test
Problem solving

UNDECIDABILITY

A Language that is not Recursively Enumerable (RE) – An Undecidable problem that is RE – Undecidable problem
about Turing Machine- Post’s Correspondence Problem – The classes P and NP

41 Recursively Enumerable 50 1 BB
Group discussion
42 Recursively Enumerable 50 1 BB
Group discussion
43 Undecidable Problems 50 1 BB
Group discussion
44 Post’s Correspondence Problem 50 1 BB
Group discussion
The classes P and NP Surprise test
45 50 1 BB
Group discussion

BB – Black Board
PP – Power Point