Department of Computer Science and Engineering

Size: px

Start display at page:

Download "Department of Computer Science and Engineering"

Joel Eaton
5 years ago
Views:

1 COURSE DELIVERY PLAN - THEORY Page 1 of 6 Department of Computer Science and Engineering B.E/B.Tech/M.E/M.Tech : B.E. Regulation: 2013 PG Specialisation : - Sub. Code / Sub. Name : CS6503 / THEORY OF COMPUTATION Unit : I Unit Syllabus: FINITE AUTOMATA LP: CS6503 Rev. No: 00 Date: Introduction- Basic Mathematical Notation and techniques- Finite State systems Basic Definitions Finite Automaton DFA & NDFA Finite Automaton with - moves Regular Languages- Regular Expression Equivalence of NFA and DFA Equivalence of NDFA s with and without -moves Equivalence of finite Automaton and regular expressions Minimization of DFA- - Pumping Lemma for Regular sets Problems based on Pumping Lemma. Objective: To introduce Finite state systems, to explain different types of Finite Automata like DFA, NDFA with and without -moves. To introduce Regular languages and expressions proofs to prove the equivalence of different automata and regular expressions, to explain how to minimize the given DFA and Pumping Lemma to prove that the given language is not regular. 1 Introduction to Automata Theory 1-Ch. 1;Pg:1-5, 3-Ch. 1;Pg:36-61, 4-Ch. 1;Pg:5-51, 5-Ch. 1;Pg:15-28, 2 Mathematical Notations and techniques 5-Ch. 1;Pg:1-14, 6-Ch. 1;Pg: 1-13, 3 Finite Automaton DFA & NDFA Definitions, Notations, Extended Transition Functions, Languages 4 Finite Automaton Problems 1-Ch. 1;Pg:28-33, 1-Ch. 2;Pg:37-60, 3-Ch. 3;Pg:71-79, 4-Ch. 2;Pg:55-73, 5-Ch. 2;Pg:35-55, 6-Ch. 3;Pg:60-68, 1-Ch. 2;Pg:47-59,Pg:66-68,72, 5-Ch. 1;Pg:37,39,41,43-47,49-50,52-54, 5 Finite Automaton with ε- moves 1-Ch. 2;Pg:72-80, 2-Ch. 4;Pg: , 6 Finite Automaton with ε- moves-problems 1-Ch. 2;Pg:73-78,80, 2-Ch. 9;Pg: Regular Languages- Regular Expression Definitions, Notations, Operators, Problems Introduction to Formal proofs, Equivalence of NFA and DFA Equivalence of NDFA s with and without - moves Theorem and Problems Equivalence of finite Automaton and regular expressions, Algebraic laws Minimization of DFA - Table Filling Algorithm 12 Pumping Lemma for Regular sets - Theorem 1-Ch. 3;Pg:83-90, 3-Ch. 5;Pg: , 4-Ch. 2;Pg:75-83, 5-Ch. 3;Pg:71-86, 6-Ch. 3;Pg:68-75, 1-Ch. 1;Pg:5-28, Pg:60-64, 3-Ch. 3;Pg:80-83, 5-Ch. 2;Pg:55-61, 6-Ch. 3;Pg:75-80, 7-Ch. 2;Pg:26-27, 1-Ch. 3;Pg:90-122, 3-Ch. 5;Pg: , 1-Ch. 4;Pg: , 3-Ch. 3;Pg:91-96, 4-Ch. 2;Pg:92-98, 1-Ch. 4;Pg: , 3-Ch. 5;Pg: , 5-Ch. 4;Pg: , 6-Ch. 4;Pg:88-90, 13 Problems based on Pumping Lemma 1-Ch. 4;Pg: , 3-Ch. 5;Pg: , 5-Ch.4;Pg: , Introduction to different types of formal proofs, Algebraic Laws Course Outcome 1: The student will be able to design Finite Automata and solve real world problems that can be represented in regular languages. * duration: 50 minutes

2 COURSE DELIVERY PLAN - THEORY Page 2 of 6 Unit : II Unit Syllabus: GRAMMARS Grammar Introduction Derivations and Languages Ambiguity- Types of Grammar - Context Free Grammars and Languages Relationship between derivation and derivation trees Simplification of CFG Elimination of Useless symbols - Unit productions - Null productions Greibach Normal form Chomsky normal form Problems related to CNF and GNF. Objective: To introduce Grammar and its types, to explain in detail about Context Free Grammars(CFG) and Languages, to introduce methods to identify ambiguous grammars, to simplify the given CFG and to find the normal forms of given CFG. 14 Grammar Introduction Types of Grammar, Derivations and Languages 3-Ch. 4;Pg: , 4-Ch. 3;Pg: , 5-Ch. 5;Pg: , 6-Ch. 2;Pg:18-24, 15 Context Free Grammars and Languages Introduction and Problems 16 CFG problems,ambiguity 17 Relationship between derivation and derivation trees 1-Ch. 5;Pg: , 3-Ch. 4;Pg: , 5-Ch. 5;Pg: , 6-Ch. 2;Pg:48-51, 1-Ch. 5;Pg: , 3-Ch. 4;Pg: , 4-Ch. 3;Pg: , 5-Ch. 5;Pg: , 6-Ch. 2;Pg:48-51, 1-Ch. 5;Pg: , 3-Ch. 6;Pg: , 4-Ch. 3;Pg: , 5-Ch. 5;Pg: , 6-Ch. 2;Pg:32-37, 1-Ch. 5;Pg: , 3-Ch. 6;Pg: , 4-Ch. 3;Pg: , 5-Ch. 5;Pg: , 18 Simplification of CFG Elimination of Useless symbols - Unit productions - Null productions - Chomsky normal form 1-Ch. 7;Pg: , 3-Ch. 6;Pg: , 5-Ch. 6;Pg: , 6-Ch. 2;Pg:37-44, 19 Problems related to CNF 20 Greibach Normal form,problems 1-Ch. 7;Pg: ,3-Ch. 6;Pg: , 5-Ch. 6;Pg: ,6-Ch. 2;Pg:42-44, 3-Ch. 6;Pg: , 7-Ch. 4;Pg:94-97, 5-Ch. 6;Pg: , 6-Ch. 2;Pg:44-46, 3-Ch. 6;Pg: , 7-Ch. 4;Pg-97-99, 5-Ch. 6;Pg: , 6-Ch. 2;Pg:46-48, Course Outcome 2: The student will be able to design Context Free Grammars, Derivation trees and Derive its Normal forms * duration: 50 mins

3 COURSE DELIVERY PLAN - THEORY Page 3 of 6 Unit : III Unit Syllabus: Pushdown Automata Pushdown Automata- Definitions Moves Instantaneous descriptions Deterministic pushdown automata Equivalence of Pushdown automata and CFL - pumping lemma for CFL problems based on pumping Lemma. Objective: To introduce Pushdown Automata, its Instantaneous descriptions and Deterministic Pushdown automata. To explain the Equivalence of Pushdown automata & Context free languages and to use pumping lemma to prove that the given language is not Context-free. 21 Pushdown Automata (PDA)- Introduction, Definitions, Language to PDA 1-Ch. 6;Pg: , 3-Ch. 7;Pg: , 4-Ch. 3;Pg: , 5-Ch. 7;Pg: , 6-Ch. 7;Pg: , 22 Moves Instantaneous descriptions 1-Ch. 6;Pg: , 3-Ch. 7;Pg: , 6-Ch. 7;Pg: , 23 Problems on designing Pushdown Automata 1-Ch. 6;Pg: , 4-Ch. 3;Pg: , 5-Ch. 7;Pg: , 6-Ch. 7;Pg: , 24 Equivalence of Pushdown automata and CFL - Context Free Grammar to PDA, PDA to Context Free Grammar Theorems 1-Ch. 6;Pg: , 3-Ch. 7;Pg: , 5-Ch. 7;Pg: , 6-Ch. 7;Pg: , 25 PDA to Context Free Grammar Problems 1-Ch. 6;Pg: , 3-Ch. 7;Pg: , 5-Ch. 7;Pg: , 6-Ch. 7;Pg: , 26 Context Free Grammar to PDA Problems 27 Deterministic Pushdown Automata 28 Pumping lemma for CFL Theorem & Problems 1-Ch. 6;Pg: , 5-Ch. 7;Pg: , 6-Ch. 7;Pg: , 1-Ch. 6;Pg: , 3-Ch. 7;Pg: , 5-Ch. 7;Pg: , 1-Ch. 7;Pg: , 3-Ch. 6;Pg: , 4-Ch. 3;Pg: , 5-Ch. 8;Pg: , 6-Ch. 8;Pg: , Course Outcome 3: The student will be able to design Pushdown Automata and identify whether the given language is context free or not using pumping lemma * duration: 50 mins

4 COURSE DELIVERY PLAN - THEORY Page 4 of 6 Unit : IV Unit Syllabus: TURING MACHINES Definitions of Turing machines Models Computable languages and functions Techniques for Turing machine construction Multi head and Multi tape Turing Machines - The Halting problem Partial Solvability Problems about Turing machine- Chomskian hierarchy of languages. Objective: To understand a Turing Machine and its variants, to construct Turing Machine for problems that are computable, to introduce to halting problem and partial solvability. Teachin g 29 Definitions of Turing machines Models 1-Ch. 8;Pg: , 2-Ch. 9;Pg: , 3-Ch. 9;Pg: , 4-Ch. 4;Pg: , 5-Ch. 9;Pg: , 6-Ch. 9;Pg: , 30 Computable languages and functions 31 Techniques for Turing machine construction Proper Subtraction, subroutines, Storage in state, Multiple Track 32 Multi head and Multi tape Turing Machines 33 The Halting problem 2-Ch. 09;Pg: , 3-Ch. 9;Pg:283, 6-Ch. 11;Pg: , 1-Ch. 8;Pg: , 3-Ch. 9;Pg: , 6-Ch. 9;Pg: , 1-Ch. 08;Pg: , 2-Ch. 08;Pg: , 3-Ch. 09;Pg: , 4-Ch. 04;Pg: , 5-Ch. 10;Pg: , 6-Ch. 10;Pg: , 5-Ch. 12;Pg: , 3-Ch. 10;Pg:314, 4-Ch. 05;Pg: , 5-Ch. 12;Pg: , 6-Ch. 11;Pg: , 34 Partial Solvability 2-Ch. 09;Pg: , 3-Ch. 11;Pg: , 35 Problems about Turing machine 36 Problems about Turing machine 37 Chomskian hierarchy of languages 2-Ch. 9;Pg: , 4-Ch. 4;Pg: , 6-Ch. 9;Pg: , 2-Ch. 9;Pg: , 4-Ch. 4;Pg: , 6-Ch. 9;Pg: , 2-Ch. 10;Pg: , 5-Ch. 11;Pg: , 6-Ch. 13;Pg: , Course Outcome 4: The student will be able to design Turing Machine using different techniques for any computable problem * duration: 50 mins

5 COURSE DELIVERY PLAN - THEORY Page 5 of 6 Unit : V Unit Syllabus: UNSOLVABLE PROBLEMS AND COMPUTABLE FUNCTIONS Unsolvable Problems and Computable Functions Primitive recursive functions Recursive and recursively enumerable languages Universal Turing machine. MEASURING AND CLASSIFYING COMPLEXITY: Tractable and Intractable problems- Tractable and possibly intractable problems P and NP completeness - Polynomial time reductions. Objective: To introduce solvable and unsolvable problems, primitive recursive functions, Recursive and recursively enumerable languages, to explain Universal Turing machine, to introduce Tractable and Intractable problems- Tractable and possibly intractable problems P and NP completeness - Polynomial time reductions. 38 Unsolvable Problems Introduction & Examples 2-Ch. 11;Pg: , 4-Ch. 5;Pg: , 5-Ch. 12;Pg: , 39 Computable Functions - functions Primitive recursive 2-Ch. 12;Pg: , 3-Ch. 11;Pg: , 4-Ch. 05;Pg: , 5-Ch. 13;Pg: , 6-Ch. 11;Pg: , 40 Recursive and recursively enumerable languages 41 Universal Turing machine 42 Measuring And Classifying Complexity 2-Ch. 10;Pg: , 3-Ch. 11;Pg: , 4-Ch. 04;Pg: , 5-Ch. 11;Pg: , 6-Ch. 11;Pg: ,Pg: , 1-Ch. 09;Pg: , 4-Ch. 05;Pg: , 5-Ch. 10;Pg: , 6-Ch. 11;Pg: , 2-Ch. 13;Pg: , 3-Ch. 12;Pg: , 5-Ch. 14;Pg: , 6-Ch. 12;Pg: , 43 Tractable and Intractable problems - Tractable and possibly intractable problems 2-Ch. 14;Pg: , 5-Ch. 14;Pg: , 6-Ch. 12;Pg: , 44 P and NP completeness Problems 45 P and NP completeness Problems 46 Polynomial time reductions 2-Ch. 14;Pg: , 3-Ch. 12;Pg: , 4-Ch. 05;Pg: ,Pg: , 5-Ch. 14;Pg: , 6-Ch. 12;Pg: , 1-Ch. 10;Pg: , 3-Ch. 12;Pg: , 4-Ch. 05;Pg: ,Pg: , 5-Ch. 14;Pg: , 6-Ch. 12;Pg: , 1-Ch. 10;Pg: , 3-Ch. 12;Pg:351, 4-Ch. 05;Pg: , 5-Ch. 14;Pg: , 6-Ch. 12;Pg: , Course Outcome 5: The student will be able to explain and demonstrate the decidability and undecidability of various problems * duration: 50 mins

6 COURSE DELIVERY PLAN - THEORY Page 6 of 6 Sub Code / Sub Name: CS6503 / THEORY OF COMPUTATION REFERENCES: TEXT BOOKS: 1. Hopcroft J.E., Motwani R. and Ullman J.D, Introduction to Automata Theory, Languages and Computations, Second Edition, Pearson Education, (UNIT 1,2,3) 2. John C Martin, Introduction to Languages and the Theory of Computation, Third Edition, Tata McGraw Hill Publishing Company, New Delhi, (UNIT 4,5) REFERENCES: 3. Mishra K L P and Chandrasekaran N, Theory of Computer Science - Automata, Languages and Computation, Third Edition, Prentice Hall of India, Harry R Lewis and Christos H Papadimitriou, Elements of the Theory of Computation, Second Edition, Prentice Hall of India, Pearson Education, New Delhi, Peter Linz, An Introduction to Formal Language and Automata, Third Edition, Narosa Publishers, New Delhi, Kamala Krithivasan and Rama. R, Introduction to Formal Languages, Automata Theory and Computation, Pearson Education Hopcroft J.E., and Ullman J.D, Introduction to Automata Theory, Languages and Computations, First Edition, Pearson Education, 2008.

A R "! I,,, !~ii ii! A ow ' r.-ii ' i ' JA' V5, 9. MiN, ;

A R ! I,,, !~ii ii! A ow ' r.-ii ' i ' JA' V5, 9. MiN, ; A R "! I,,, r.-ii ' i '!~ii ii! A ow ' I % i o,... V. 4..... JA' i,.. Al V5, 9 MiN, ; Logic and Language Models for Computer Science Logic and Language Models for Computer Science HENRY HAMBURGER George