Year : II (2011-2012 Rajasthan Institute of Engineering & Technology, Jaipur

(Approved by AICTE and Affiliated to RTU, Kota)

COURSE FILE Sem : VI : : : AMIT KUMAR BAIRWA ASSISTANT PROFESSOR COMPUTER SCIENCE AND ENGINEERING

1. 2. 3.

Name of the Faculty Designation Department

Guidelines to Study the Subject What can be computed? For the purposes of this course, we consider a very simple model of a problem. A problem is a set of strings (often binary strings) that we wish to distinguish. For example, one problem might be the set of all binary strings divisible by three. To solve this problem we need to be able to say yes or no to each candidate binary string as to whether it is in the set or not. If we have an algorithm to do this, then we have solved the problem. These kinds of problems are called decidable. More complicated inputs over larger alphabets can be considered as well. For example, we can consider lists of numbers as the input, where each list has numbers written in binary with a # symbol separating each one from the other. A problem is the set of all such strings where the numbers are in ascending order. Even more complicated examples are easy to imagine. Consider the set of all syntactically legal Java programs. These strings are over a large alphabet of symbols. This problem can be solved with a compiler. Consider the set of all syntactic legal Java programs that never go to into an infinite loop on any input. There is no way to solve this problem. This problem is undecidable. For our purposes we think of a machine, or automaton, as a guard at the door of an exclusive club that admits only specific kinds of binary strings. The machine is given a program by the boss. It looks at each candidate string trying to enter the club, and it executes the program by looking at deciding for each one: yes or no. There are different kinds of machines, each one a little more powerful than the rest. What kinds of sets are recognized by different machines? What features can you add to a machine to make it more powerful, that is able to recognize sets that it could not recognize before? Can we measure time and space requirements of a machine as a tradeoff to this power? The chart below summarizes the levels of machines we will discuss in this class. The machines have equivalent formulations as grammars or other forms. Machine Grammar Finite State Machine Right/Left Linear Grammars Deterministic Pushdown Machine Non-Deterministic Pushdown Machine Turing Machine Context Free Grammars LR Grammars Unrestricted Grammars Recursive Sets Other Regular Expressions Syntax Diagrams

The top level is the least powerful and we start from there. -1-

Year : III (2012-2013) Rajasthan Institute of Engineering & Technology, Jaipur

(Approved by AICTE and Affiliated to RTU, Kota)

COURSE FILE Sem : VI : : : AMIT KUMAR BAIRWA ASSISTANT PROFESSOR COMPUTER SCIENCE AND ENGINEERING

1. 2. 3.

Name of the Faculty Designation Department

On completion of this Subject / Course the students shall be able to: S.No. Objectives y The course aims to teach the basic methods and conclusions of the 1. y y 2. y y 3. y y y 4. y y 5.
Prove the undecidability or complexity of a variety of problems. Beyond Syllabus: Theory of Computation. Students learn to apply these methods to problems from different fields and be guided by the results in searching for computational solutions to the problems. Beyond Syllabus: Explain the theoretical limits on computational solutions of undecidable and inherently complex problems. Beyond Syllabus: Describe concrete examples of computationally undecidable or inherently infeasible problems from different fields. Beyond Syllabus: Understand formal definitions of machine models. Beyond Syllabus:

Outcomes A,G,I

C,E,I

C,I,J

B,C,F

B, D,H

Signature of Faculty Date

Note: For each of the OBJECTIVE indicate the appropriate OUTCOMES to be achieved. -2-

Year : III (2012-2013) Rajasthan Institute of Engineering & Technology, Jaipur

(Approved by AICTE and Affiliated to RTU, Kota)

COURSE FILE Sem : VI : : : AMIT KUMAR BAIRWA ASSISTANT PROFESSOR COMPUTER SCIENCE AND ENGINEERING

1. 2. 3.

Name of the Faculty Designation Department

The expected outcomes of the Course / Subject are: S.No. General Categories of Outcomes
A B C An ability to apply knowledge of mathematics, science, and engineering An ability to design and conduct experiment, as well as to analyze and interpret data An ability to design a system, component or process to meet desired need within realistic, Constraints such as economic, environmental, social, political, ethical, health and safety, Manufacturability and sustain ability. An ability to function on multi-disciplinary teams. An ability to identify, formulates, and solves engineering Problems. An understanding of professional and ethical responsibility The broad education necessary to understand the impact of engineering solutions in a global, economic, environmental, and societal context. A recognition of the need for, and an ability to engage in life-long learning Knowledge of contemporary issues. An ability to use the techniques, skills, and modern engineering tools necessary of engineering practice.

Specific Outcomes of the Course

Synthesize finite automata with specific properties. Use the pumping lemma and closure properties to prove particular problems cannot be solved by finite automata. Prove undecidability using diagonalization and reducibility methods.

D E F G

Use the relationship between recognizability and decidability to determine decidability properties of problems. Describe concrete examples of undecidable problems from different fields. Calculate asymptotic estimates of the computational complexity of simple procedures from automata, language and graph theory. Describe concrete examples of NP-complete problems from different fields. Prove lower bounds on time and space complexity using polynomial time and log space reducibility methods. Define deterministic and nondeterministic computation time and space, and explain Define deterministic and nondeterministic computation time and space, and explain

H I J

Objectives Outcome Relationship Matrix (Indicate the relationship by x mark).

Outcomes

A
Objectives

1 2 3 4 5 6

-3-

Year : III (2012-2013) Rajasthan Institute of Engineering & Technology, Jaipur

(Approved by AICTE and Affiliated to RTU, Kota)

COURSE FILE Subject: TOC : : : AMIT KUMAR BAIRWA ASSISTANT PROFESSOR COMPUTER SCIENCE AND ENGINEERING Sem : VI

1. 2. 3.

Name of the Faculty Designation Department

The Schedule for the Course / Subject is: S. No. Description/Units

Expected Date of Completion Finite Automata & Regular Expression: Basic 03-FebConcepts of finite state system, Deterministic 2012 and non-deterministic finite automation and designing regular expressions, relationship between regular expression & Finite automata minimization of finite automation mealy & Moore Machines. Regular Sets of Regular Grammars: Basic 29-FebDefinition of Formal Language and Grammars. 2012
Regular Sets and Regular Grammars, closure proportion of regular sets, Pumping lemma for regular sets, decision Algorithms for regular sets, Myhell_Nerod Theory & Organization of Finite Automata. Context Free Languages& Pushdown 31-MarAutomata: Context Free Grammars 2012 Derivations and Languages Relationship between derivation and derivation trees ambiguity simplification of CEG Greiback Normal form Chomsky normal forms Problems re lated to CNF and GNF Pushdown Automata:

Revision Date

Total No. of Periods 11

11

12

Definitions Moves Instantaneous descriptions Deterministic pushdown automata Pushdown automata and CFL - pumping lemma for CFL - Applications of pumping Lemma. Total No. of Instruction Periods available for the course: Hours / Periods

-4-

Year : III (2012-2013) Rajasthan Institute of Engineering & Technology, Jaipur

(Approved by AICTE and Affiliated to RTU, Kota)

COURSE FILE Subject: TOC : : : AMIT KUMAR BAIRWA ASSISTANT PROFESSOR COMPUTER SCIENCE AND ENGINEERING Sem : VI

1. 2. 3.

Name of the Faculty Designation Department

The Schedule for the Course / Subject is: S.No. Description/Units

Expected Date of Completion Turing Machines: Turing machines 28-AprilComputable Languages and functions 2012 Turing Machine constructions Storage in finite control multiple tracks checking of symbols subroutines two way infinite tape. Undecidability:
Properties of recursive and Recursively enumerable languages Universal Turing Machines as an undecidable problem Universal Languages Rices Theorems. Linear bounded Automata Context Sensitive 16-MayLanguage: Chomsky Hierarchy of Languages 2012 and automata,

Revision Date

Total No. of Periods 12

Basic Definition & descriptions of Theory & Organization of Linear bounded Automata Properties of context-sensitive languages Total No. of Instruction period available for the course: Hours / Periods

-5-

Year : III (2012-2013) Rajasthan Institute of Engineering & Technology, Jaipur

(Approved by AICTE and Affiliated to RTU, Kota)

COURSE SCHEDULE(Unit Wise) UNIT - I : : : AMIT KUMAR BAIRWA ASSISTANT PROFESSOR COMPUTER SCIENCE AND ENGINEERING Topics / Sub Topics Objectives & Outcome Nos. A,G,I Reference (Text Book, Journal.) Page No.to 1. Aho, Hopcroft and Ullman, Introduction to Automata Theory, Formal Languages and Computation TMH, Edition 2001, Re-Printed 2010, ISBN-9780-07-044687-8 2. apadimitriou, Introduction to Theory of Computing, Prentice Hall, Edition 1995, Re-Printed 2011, ISBN-978-817029-753-6 Sem : VI

1. 2. 3. S. No.

Name of the Faculty Designation Department Date No. of Periods

1 Finite Automata & Regular Expression: Basic Concepts of finite state system,

1 Deterministic and non-deterministic finite automation and

A,G,I

1 designing regular expressions,

A,G,I

1 relationship between regular expression & Finite automata

A,G,I

5 6 7 8

3 minimization of finite automation 2 mealy & Moore Machines. 1 UNIT TEST 1 Beyond Syllabus

A,G,I A,G,I

Signature of Faculty Date Note : 1. 2. 3. ENSURE THAT ALL THE TOPICS SPECIFIED IN THE COURSE ARE MENTIONED. ADDITIONAL TOPICS COVERED, IF ANY, MAY ALSO BE SPECIFIED IN BOLD. MENTION THE CORRESPONDING COURSE OBJECTIVE AND OUTCOME NUMBERS AGAINST EACH TOPIC.

-6-

Year : III (2012-2013) Rajasthan Institute of Engineering & Technology, Jaipur

(Approved by AICTE and Affiliated to RTU, Kota)

COURSE SCHEDULE(Unit Wise) UNIT - II : : : AMIT KUMAR BAIRWA ASSISTANT PROFESSOR COMPUTER SCIENCE AND ENGINEERING Topics / Sub Topics Sem : VI

1. 2. 3. S.No.

Name of the Faculty Designation Department Date No. of Periods 1

Objectives Reference (Text & Outcome Book, Journal.) Nos. Page No.to Regular Sets of Regular C,E,I 1. Aho, Hopcroft Grammars: Basic Definition of and Ullman, Formal Language and Introduction to Grammars. Automata Theory, Formal Languages and Computation Regular Sets and Regular C,E,I TMH, Edition Grammars, 2001, Re-Printed 2010, ISBN-978-0closure proportion of regular C,E,I 07-044687-8 sets, Pumping lemma for regular sets, C,E,I decision Algorithms for regular C,E,I sets, Myhell_Nerod Theory Organization of Finite Automata. UNIT TEST Beyond Syllabus C,E,I C,E,I 2. Papadimitriou, Introduction to Theory of Computing, Prentice Hall, Edition 1995, RePrinted 2011, ISBN-978-817029-753

4 5

2 1

6 7 8 9

1 1 1 1

Signature of Faculty Date Note: 1. 2. 3. ENSURE THAT ALL THE TOPICS SPECIFIED IN THE COURSE ARE MENTIONED. ADDITIONAL TOPICS COVERED, IF ANY, MAY ALSO BE SPECIFIED IN BOLD. MENTION THE CORRESPONDING COURSE OBJECTIVE AND OUTCOME NUMBERS AGAINST EACH TOPIC.

-7-

Year : III (2012-2013) Rajasthan Institute of Engineering & Technology, Jaipur

(Approved by AICTE and Affiliated to RTU, Kota)

COURSE SCHEDULE(Unit Wise) UNIT - III : : : AMIT KUMAR BAIRWA ASSISTANT PROFESSOR COMPUTER SCIENCE AND ENGINEERING Topics / Sub Topics Sem : VI

1. 2. 3. S.No.

Name of the Faculty Designation Department Date No. of Periods 1

3 4 5 6 7

1 1 1 1 1

Objectives Reference (Text & Outcome Book, Journal.) Nos. Page No.to Context Free Languages& C,I,J 1. Aho, Hopcroft Pushdown Automata: Context Free and Ullman, Grammars Introduction to Automata Theory, Derivations and Languages C,I,J Formal Languages Relationship between derivation and and Computation derivation tree TMH, Edition trees ambiguity C,I,J 2001, Re-Printed simplification of CEG Greiback C,I,J 2010, ISBN-978-0Normal form 07-044687-8 Chomsky normal forms C,I,J Problems related to CNF and GNF C,I,J 2. Papadimitriou, Introduction to Theory of Computing, Prentice Hall, Edition 1995, RePrinted 2011, ISBN-978-817029-753

Pushdown Automata: Definitions C,I,J Moves Instantaneous descriptions Deterministic pushdown automata C,I,J Pushdown automata and CFL pumping lemma for CFL Applications of pumping Lemma UNIT TEST Beyond Syllabus C,I,J C,I,J

9 10 11

1 1 1 1

12
Signature of Faculty Date Note : 1. 2. 3. ENSURE THAT ALL THE TOPICS SPECIFIED IN THE COURSE ARE MENTIONED. ADDITIONAL TOPICS COVERED, IF ANY, MAY ALSO BE SPECIFIED IN BOLD. MENTION THE CORRESPONDING COURSE OBJECTIVE AND OUTCOME NUMBERS AGAINST EACH TOPIC.

-8-

Year : III (2012-2013) Rajasthan Institute of Engineering & Technology, Jaipur

(Approved by AICTE and Affiliated to RTU, Kota)

COURSE SCHEDULE(Unit Wise) UNIT - IV : : : AMIT KUMAR BAIRWA ASSISTANT PROFESSOR COMPUTER SCIENCE AND ENGINEERING Topics / Sub Topics Sem : VI

1. 2. 3. S.No.

Name of the Faculty Designation Department Date No. of Periods 1

2 3

1 2

Objectives Reference (Text & Outcome Book, Journal.) Nos. Page No.to Turing Machines: Turing machines B,C,F 1. Aho, Hopcroft Computable Languages and functions and Ullman, Introduction to Automata Theory, Turing Machine constructions B,C,F Formal Languages and Computation Storage in finite control multiple B,C,F TMH, Edition tracks 2001, Re-Printed 2010, ISBN-978-0checking of symbols subroutines B,C,F 07-044687-8 two way infinite tape Undecidability: recursive and Properties of B,C,F 2. Papadimitriou, Introduction to Theory of Computing, Prentice Hall, Edition 1995, RePrinted 2011, ISBN-978-817029-753

6 7

1 2

8 9

1 1

Recursively enumerable languages B,C,F Universal Turing Machines as an undecidable B,C,F problem Universal Languages Rices Theorems. UNIT TEST Beyond Syllabus

Signature of Faculty Date Note : 1. 2. 3. ENSURE THAT ALL THE TOPICS SPECIFIED IN THE COURSE ARE MENTIONED. ADDITIONAL TOPICS COVERED, IF ANY, MAY ALSO BE SPECIFIED IN BOLD. MENTION THE CORRESPONDING COURSE OBJECTIVE AND OUTCOME NUMBERS AGAINST EACH TOPIC.

-9-

Year : III (2012-2013) Rajasthan Institute of Engineering & Technology, Jaipur

(Approved by AICTE and Affiliated to RTU, Kota)

COURSE SCHEDULE(Unit Wise) UNIT - V : : : AMIT KUMAR BAIRWA ASSISTANT PROFESSOR COMPUTER SCIENCE AND ENGINEERING Topics / Sub Topics Sem : VI

1. 2. 3. S.No.

Name of the Faculty Designation Department Date No. of Periods 1

4 5 6

1 1 1

Objectives Reference (Text & Outcome Book, Journal.) Nos. Page No.to Linear bounded Automata Context B, D,H 1. Aho, Hopcroft Sensitive Language and Ullman, Introduction to Automata Theory, Chomsky Hierarchy of B, D,H Formal Languages Languages and automata and Computation TMH, Edition Basic Definition & descriptions of B, D,H 2001, Re-Printed Theory & Organization of Linear 2010, ISBN-978-0bounded Automata 07-044687-8 Properties of context-sensitive B, D,H 2. Papadimitriou, Languages Introduction to UNIT TEST B, D,H Theory of Beyond Syllabus B, D,H Computing, Prentice Hall, Edition 1995, RePrinted 2011, ISBN-978-817029-753

Signature of Faculty Date Note : 1. 2. 3. ENSURE THAT ALL THE TOPICS SPECIFIED IN THE COURSE ARE MENTIONED. ADDITIONAL TOPICS COVERED, IF ANY, MAY ALSO BE SPECIFIED IN BOLD. MENTION THE CORRESPONDING COURSE OBJECTIVE AND OUTCOME NUMBERS AGAINST EACH TOPIC.

- 10 -