Lovely Professional University,Punjab

Format For Instruction Plan [for Courses with Lectures and Labs

Course No CSE321

Cours Title AUTOMATA THEORY

Course Planner 13742 :: Mandeep Singh

Lectures Tutorial Practical Credits 4 0 0 4

Text Book:

1 K.L.P Mishra & N. Chandrasekran, Theory of Computer Science :Automata, languages & Computation, PHI.

Other Specific Book:

2 Hopcroft, Motwani ,Ullman, “Introducation to Automata Theory, languages, & computation’, Pearson. 3 John C Martin, “Introduction to languages & the Theory of Computation” , TMG . 4 G. E. Reevsz, Introduction to Formal Languages, McGraw Hill 1983. 5 M. H. Harrison, Formal Language Theory Addison Wesley 1978. 6 Wolfman Theory and Applications of Cellular Automata, World Scientists, Singapore. 7 Adesh Kumar Pandey “Introduction to Automata Theory and Formal Languages” Kataria and Sons

Other Reading Sr No Jouranls atricles as compulsary readings (specific articles, Complete reference) 8 www.jalc.de< Journal of Automata, Languages and Combinatorics > 9 www.tik.ee.ethz.ch/tik/education/lectures/DES/Book/des_book_automata.pdf Relevant Websites

1

Approved for Spring Session 2010-11

html 11 www.1 Ch.edu/content/ services/document.utexas. 3 Pg No.Equivalenc e. acceptability of a string by a FA DFA and NDFA DFA and NDFA Equivalence of DFA and NDFA Lecture 7 Lecture 8 Week 3 Lecture 9 Lecture 10 Mealy and Moore machine Mealy and Moore machine Minimization of Finite Automata Minimization of Finite Automata 2 Approved for Spring Session 2010-11 .stanford.cecs. No.ppt http://users.Sr.1 Ch..php/ 59577.1 Ch.1 Ch.ece. 3 Pg No. 3 Pg No.html Salient Features Provides information about basics of automata theory Demonstrates turing machine Detailed Plan For Lectures Week Number Lecture Number Lecture Topic Chapters/Sections of Homework to be Assigned Pedagogical tool Textbook/other to students Demonstration/case reference study/images/anmatio n ctc. 3 Pg No.e du/~adnan/verif04/fsa.pdx./LE CTURE_A_4.pdf-search-engine.78 Book :1.DFA.1 Ch 3 Pg No. planned Part 1 Week 1 Lecture 1 Introduction to Finite Automata Book :1..edu/~eroberts/courses/soco/projects/200405/automata-theory/basics.1 Ch.74 Book :1. 91 web. 80 Book :1. (Web adress) (only if relevant to the courses) 10 www-csfaculty. 3 Pg No.com/basic-turing-machine--pdf. 3 Pg No.pdf www. Term Paper 1 Allocation 84-87 HomeWork 1 Allocation Book :1. 3 Pg No.baylor.78 Book :1.ppt Lecture 2 Description of FA Lecture 3 Lecture 4 Week 2 Lecture 5 Lecture 6 Transition systems and its properties.1 Ch. 73 Book :1.edu/.71-72 Book :1.1 Ch.NDFA.

1 Ch. 126-128 Operations on languages. 140-148 Book :1. 6 Pg No. 5 Pg 162 Book :1. 140-148 Book :1.. 107 http://www. 120 Book :1. 4 Pg No.Week 3 Lecture 11 Formal languages.1 Ch. 153 3 .clemson.1 Ch. Languages and automata Linear Grammars and regular Languages HomeWork 1 Submission Book :1.1 Ch.ces.1 Ch. 5 Pg No. HomeWork 2 Allocation 136-141 www.. 6 Pg No. pdf Lecture 12 Week 4 Lecture 13 Chomsky classification of languages Chomsky classification of languages Book :1. 4 Pg No.1 Ch. 5 Pg 162 HomeWork 2 Submission Book :1./Regular_Grammars. 188 Approved for Spring Session 2010-11 Book :1. 5 Pg No.rpi. 123-126 Operations on languages.1 Ch. ppt Lecture 18 Lecture 19 Lecture 20 Week 6 Lecture 21 Lecture 22 Lecture 23 Lecture 24 Week 7 Lecture 25 Lecture 26 Lecture 27 Lecture 28 Regular Expression and Regular sets Regular Expression and Regular sets Construction of Regular expression equivalent to Finite Automata Construction of Regular expression equivalent to Finite Automata using Arden's theorem Construction of Finite Automata equivalent to Regular expression Construction of Finite Automata equivalent to Regular expression Pumping Lemma for regular sets & its applications Pumping Lemma for regular sets & its applications Context Free languages(CFG) and derivation trees Context Free languages(CFG) and derivation trees Ambiguity in CFG Book :1. 5 Pg No. 5 Pg No. basic definitions and examples Book :1.1 Ch. edu/~warner/M865/auto mata/FormalLanguages. 120 Part 2 Week 4 Lecture 14 Lecture 15 Lecture 16 Week 5 Lecture 17 Languages and their relations.1 Ch.edu/~moorth y/.cs.1 Ch. 4 Pg No.1 Ch.1 Ch.1 Ch. 4 Pg No. 181 Book :1. 4 Pg No. Languages and automata Book :1. Recursive and recursive enumerable sets Book :1.

1 Ch.1 Ch. 9 Pg No.1 Ch. 7 Pg No.7 Ch 13 Pg No.1 Ch. 9 Pg No.308 Book :7. 278-279 Book :1.201 Book :1. 7 Pg No. 189-201 Part 4 Week 10 Week 11 Lecture 40 Lecture 41 Lecture 42 Lecture 43 Lecture 44 Week 12 Lecture 45 Representation of Turing machine Design of Turing Machine Design of Turing Machine Syntax Analysis: Ambiguity and the formal power Series Formal Properties of LL(k) Formal Properties of LR(k) Book :7.1 Ch 6 Pg No. HomeWork 4 Allocation 284 4 Approved for Spring Session 2010-11 .1 Ch. 9 Pg No.314 Book :1.206 Book :7.1 Ch. Unrestricted Languages Finite Push Down Automata 2 Push Down Automata 2 Push Down Automata Turing Machine.1 Ch 6 Pg No. HomeWork 3 Submission 278-279 Book :1.267 Term Paper 1 Submission Book :1. 227 HomeWork 3 Allocation Book :1. 6 Pg No.301 Book :1. Representation of Turing machine Book :1.300 Book :7.1 Ch 8 Pg No.MID-TERM Part 3 Week 8 Lecture 29 Lecture 30 Lecture 31 Lecture 32 Week 9 Lecture 33 Lecture 34 Lecture 35 Lecture 36 Week 10 Lecture 37 Lecture 38 Lecture 39 Simplification of context free grammars Simplification of context free grammars Chomsky Normal Form Greibach Normal Form Greibach Normal Form Kuroda Normal Form One sided Context Sensitive Grammars.7 Ch 12 Pg No. 227 Book :1.7 Ch 12 Pg No.1 Ch.7 Ch 13 Pg No.206 Book :1. 6 Pg No.

Regular Expression CNF.336 HomeWork 4 Submission Week 13 Lecture 49 Lecture 50 Lecture 51 Lecture 52 Spill Over Week 14 Lecture 53 P and NP complete Problem. PCP(Post Correspondence problem) Techniques for Turing Machine Construction.7 Ch 15 Pg No.324 Book :7.7 Ch 15 Pg No.7 Ch 15 Pg No.332 Book :7. GNF.330 Book :7. PDA Syntax Analysis.349 & Ch 10 Pg No.1 Ch 9 Lecture 54 Details of homework and case studies Homework No. The Model of Linear Bounded Automata Book :1.329 Book :7.7 Ch 15 Pg No.1 Ch 12 Pg no.315 Book :1.7 Ch 15 Pg No.Week 12 Lecture 46 Lecture 47 Lecture 48 Derivation Language: Rewriting Systems Algebraic properties Canonical Derivation Cellular Automata Formal Language aspects Algebraic Properties Universality Complexity Variants Book :7. Turing machine Topic of the Homework Nature of homework (group/individuals/field work Individual Individual Individual Individual Scheme for CA:out of 100* 5 Approved for Spring Session 2010-11 .335 Book :7.7 Ch 15 Pg No. Homework 1 Homework 2 Homework 3 Homework 4 Finite Automata Regular Sets.

Component Term Paper Homework Class test based on homework Frequency 1 3 3 Out Of Each Marks Total Marks 25 4 4 7 18 50 25 21 54 100 Total :- * In ENG courses wherever the total exceeds 100. No. as explained in teacher's guide available on the UMS List of suggested topics for term paper[at least 15] (Student to spend about 15 hrs on any one specified term paper) Sr. Topic 1 Finite automata and decision problems 2 Pumping lemma for grammars 3 Regular Grammars and Regular sets 4 Regular and Non Regular Languages 5 Ambiguity and Membership algorithms in Context-Free Grammars 6 Push Down Automata and Context-Free languages 7 Closure properties and Decision Algorithms for Context-Free Grammars 8 Post Machines 9 2-stack Push Down Automata and Minsky’s theorem 10 Variations on Turing Machines 11 Turing Machines Languages 12 Chomsky Hierarchy 13 Computable Functions 14 Church’s Thesis 15 Turing Machines as language Generator 6 Approved for Spring Session 2010-11 . consider x best out of y components of CA.

Sign up to vote on this title
UsefulNot useful