Lovely Professional University,Punjab
Format For Instruction Plan [for Courses with Lectures and Labs
Course No Cours Title Course Planner Lectures Tutorial Practical Credits
CSE321 AUTOMATA THEORY 13742 :: Mandeep Singh 4 0 0 4
Text Book: 1 K.L.P Mishra & N. Chandrasekran, Theory of Computer Science :Automata, languages & Computation, PHI.
Other Specific Book:
1 Approved for Spring Session 2010-11
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
9 www.tik.ee.ethz.ch/tik/education/lectures/DES/Book/des_book_automata.pdf
Relevant Websites
Sr. No. (Web adress) (only if relevant to the courses) Salient Features
10 www-cs- Provides information about basics of automata theory
faculty.stanford.edu/~eroberts/courses/soco/projects/2004-
05/automata-theory/basics.html
11 www.pdf-search-engine.com/basic-turing-machine--pdf.html Demonstrates turing machine
Detailed Plan For Lectures
Week Lecture Lecture Topic Chapters/Sections Homework to Pedagogical tool Demonstration/case study/images/anmation ctc.
Number Number of Textbook/other be Assigned to planned
2 Approved for Spring Session 2010-11
reference students
Part 1
Week 1 Lecture 1 Introduction to Finite Book :1,1 Ch 3 Pg http://users.ece.utexas.edu/~adnan/verif-04/fsa.pdf
Automata No.71-72
Lecture 2 Description of FA Book :1,1 Ch. 3 Pg www.baylor.edu/content/services/document.php/59577.ppt
No. 73
Lecture 3 Transition systems and its Book :1,1 Ch. 3 Pg
properties, acceptability of No.74
a string by a FA
Lecture 4 DFA and NDFA Book :1,1 Ch. 3 Pg
No.78
Week 2 Lecture 5 DFA and NDFA Book :1,1 Ch. 3 Pg
No.78
Lecture 6 Equivalence of DFA and Book :1,1 Ch. 3 Pg web.cecs.pdx.edu/.../LECTURE_A_4.Equivalence.NDFA.DFA.ppt
NDFA No. 80
Lecture 7 Mealy and Moore machine Book :1,1 Ch. 3 Pg Term Paper 1
No. 84-87 Allocation
Lecture 8 Mealy and Moore machine HomeWork 1
Allocation
Week 3 Lecture 9 Minimization of Finite Book :1,1 Ch. 3 Pg
Automata No. 91
Lecture 10 Minimization of Finite
Automata
Lecture 11 Formal languages, basic Book :1,1 Ch. 4 Pg http://www.ces.clemson.edu/~warner/M865/automata/FormalLanguages.pdf
definitions and examples No. 107
Lecture 12 Chomsky classification of Book :1,1 Ch. 4 Pg
languages No. 120
Week 4 Lecture 13 Chomsky classification of Book :1,1 Ch. 4 Pg
languages No. 120
Part 2
3 Approved for Spring Session 2010-11
Week 4 Lecture 14 Languages and their Book :1,1 Ch. 4 Pg
relations, Recursive and No. 123-126
recursive enumerable sets
Lecture 15 Operations on languages, Book :1,1 Ch. 4 Pg
Languages and automata No. 126-128
Lecture 16 Operations on languages, HomeWork 1
Languages and automata Submission
Week 5 Lecture 17 Linear Grammars and Book :1,1 Ch. 5 Pg HomeWork 2 www.cs.rpi.edu/~moorthy/.../Regular_Grammars.ppt
regular Languages No. 136-141 Allocation
Lecture 18 Regular Expression and
Regular sets
Lecture 19 Regular Expression and
Regular sets
Lecture 20 Construction of Regular Book :1,1 Ch. 5 Pg
expression equivalent to No. 140-148
Finite Automata
Week 6 Lecture 21 Construction of Regular Book :1,1 Ch. 5 Pg
expression equivalent to No. 140-148
Finite Automata using
Arden's theorem
Lecture 22 Construction of Finite Book :1,1 Ch. 5 Pg
Automata equivalent to No. 153
Regular expression
Lecture 23 Construction of Finite
Automata equivalent to
Regular expression
Lecture 24 Pumping Lemma for Book :1,1 Ch. 5 Pg HomeWork 2
regular sets & its 162 Submission
applications
Week 7 Lecture 25 Pumping Lemma for Book :1,1 Ch. 5 Pg
regular sets & its 162
applications
Lecture 26 Context Free Book :1,1 Ch. 6 Pg
languages(CFG) and No. 181
derivation trees
Lecture 27 Context Free
languages(CFG) and
derivation trees
4 Approved for Spring Session 2010-11
Lecture 28 Ambiguity in CFG Book :1,1 Ch. 6 Pg
No. 188
MID-TERM
Part 3
Week 8 Lecture 29 Simplification of context Book :1,1 Ch. 6 Pg
free grammars No. 189-201
Lecture 30 Simplification of context
free grammars
Lecture 31 Chomsky Normal Form Book :1,1 Ch. 6 Pg
No.201
Lecture 32 Greibach Normal Form Book :1,1 Ch 6 Pg HomeWork 3
No.206 Allocation
Week 9 Lecture 33 Greibach Normal Form Book :1,1 Ch 6 Pg
No.206
Lecture 34 Kuroda Normal Form Book :7,7 Ch 12 Pg
No.300
Lecture 35 One sided Context Book :7,7 Ch 12 Pg
Sensitive Grammars, No.301
Unrestricted Languages
Lecture 36 Finite Push Down Book :1,1 Ch. 7 Pg
Automata No. 227
Week 10 Lecture 37 2 Push Down Automata Book :1,1 Ch. 7 Pg
No. 227
Lecture 38 2 Push Down Automata
Lecture 39 Turing Machine, Book :1,1 Ch. 9 Pg
Representation of Turing No. 278-279
machine
Part 4
Week 10 Lecture 40 Representation of Turing Book :1,1 Ch. 9 Pg HomeWork 3
machine No. 278-279 Submission
Week 11 Lecture 41 Design of Turing Machine Book :1,1 Ch. 9 Pg HomeWork 4
No. 284 Allocation
Lecture 42 Design of Turing Machine
5 Approved for Spring Session 2010-11
Lecture 43 Syntax Analysis: Book :7,7 Ch 13 Pg
Ambiguity and the formal No.308
power Series
Lecture 44 Formal Properties of LL(k) Book :7,7 Ch 13 Pg Term Paper 1
No.314 Submission
Week 12 Lecture 45 Formal Properties of LR(k) Book :1,1 Ch 8 Pg
No.267
Lecture 46 Derivation Language: Book :7,7 Ch 15 Pg
Rewriting Systems No.324
Lecture 47 Algebraic properties
Lecture 48 Canonical Derivation Book :7,7 Ch 15 Pg
No.329
Week 13 Lecture 49 Cellular Automata Book :7,7 Ch 15 Pg HomeWork 4
No.330 Submission
Lecture 50 Formal Language aspects Book :7,7 Ch 15 Pg
No.332
Lecture 51 Algebraic Properties Book :7,7 Ch 15 Pg
Universality No.335
Lecture 52 Complexity Book :7,7 Ch 15 Pg
Variants No.336
Spill Over
Week 14 Lecture 53 P and NP complete Book :1,1 Ch 12 Pg
Problem, PCP(Post no.349 & Ch 10 Pg
Correspondence problem) No.315
Lecture 54 Techniques for Turing Book :1,1 Ch 9
Machine Construction,
The Model of Linear
Bounded Automata
Details of homework and case studies
Homework No. Topic of the Homework Nature of homework
(group/individuals/field work
Homework 1 Finite Automata Individual
6 Approved for Spring Session 2010-11
Homework 2 Regular Sets, Regular Expression Individual
Homework 3 CNF, GNF, PDA Individual
Homework 4 Syntax Analysis, Turing machine Individual
Scheme for CA:out of 100*
Component Frequency Out Of Each Marks Total Marks
Term Paper 1 25 25
Homework 3 4 7 21
Class test based on homework 3 4 18 54
Total :- 50 100
* In ENG courses wherever the total exceeds 100, consider x best out of y components of CA, 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. No. 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
7 Approved for Spring Session 2010-11
11 Turing Machines Languages
12 Chomsky Hierarchy
13 Computable Functions
14 Church’s Thesis
15 Turing Machines as language Generator
8 Approved for Spring Session 2010-11