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:

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

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 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. planned

Part 1
Week 1 Lecture 1 Introduction to Finite Automata Book :1,1 Ch 3 Pg http://users.ece.utexas.e
No.71-72 du/~adnan/verif-
04/fsa.pdf
Lecture 2 Description of FA Book :1,1 Ch. 3 Pg No. www.baylor.edu/content/
73 services/document.php/
59577.ppt
Lecture 3 Transition systems and its properties, acceptability Book :1,1 Ch. 3 Pg
of a string by a FA No.74
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 NDFA Book :1,1 Ch. 3 Pg No. web.cecs.pdx.edu/.../LE
80 CTURE_A_4.Equivalenc
e.NDFA.DFA.ppt
Lecture 7 Mealy and Moore machine Book :1,1 Ch. 3 Pg No. Term Paper 1 Allocation
84-87
Lecture 8 Mealy and Moore machine HomeWork 1 Allocation

Week 3 Lecture 9 Minimization of Finite Automata Book :1,1 Ch. 3 Pg No.

91
Lecture 10 Minimization of Finite Automata

2 Approved for Spring Session 2010-11

Week 3 Lecture 11 Formal languages, basic definitions and examples Book :1,1 Ch. 4 Pg No. http://www.ces.clemson.
107 edu/~warner/M865/auto
mata/FormalLanguages.
pdf
Lecture 12 Chomsky classification of languages Book :1,1 Ch. 4 Pg No.
120
Week 4 Lecture 13 Chomsky classification of languages Book :1,1 Ch. 4 Pg No.
120

Part 2
Week 4 Lecture 14 Languages and their relations, Recursive and Book :1,1 Ch. 4 Pg No.
recursive enumerable sets 123-126
Lecture 15 Operations on languages, Languages and automata Book :1,1 Ch. 4 Pg No.
126-128
Lecture 16 Operations on languages, Languages and automata HomeWork 1 Submission

Week 5 Lecture 17 Linear Grammars and regular Languages Book :1,1 Ch. 5 Pg No. HomeWork 2 Allocation www.cs.rpi.edu/~moorth
136-141 y/.../Regular_Grammars.
ppt
Lecture 18 Regular Expression and Regular sets

Lecture 19 Regular Expression and Regular sets

Lecture 20 Construction of Regular expression equivalent to Book :1,1 Ch. 5 Pg No.

Finite Automata 140-148
Week 6 Lecture 21 Construction of Regular expression equivalent to Book :1,1 Ch. 5 Pg No.
Finite Automata using Arden's theorem 140-148
Lecture 22 Construction of Finite Automata equivalent to Book :1,1 Ch. 5 Pg No.
Regular expression 153
Lecture 23 Construction of Finite Automata equivalent to
Regular expression
Lecture 24 Pumping Lemma for regular sets & its applications Book :1,1 Ch. 5 Pg 162 HomeWork 2 Submission
Week 7 Lecture 25 Pumping Lemma for regular sets & its applications Book :1,1 Ch. 5 Pg 162
Lecture 26 Context Free languages(CFG) and derivation trees Book :1,1 Ch. 6 Pg No.
181
Lecture 27 Context Free languages(CFG) and derivation trees

Lecture 28 Ambiguity in CFG Book :1,1 Ch. 6 Pg No.

188

3 Approved for Spring Session 2010-11

 MID-TERM
Part 3
Week 8 Lecture 29 Simplification of context free grammars Book :1,1 Ch. 6 Pg 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 Allocation
No.206
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 Sensitive Grammars, Book :7,7 Ch 12 Pg
Unrestricted Languages No.301
Lecture 36 Finite Push Down Automata Book :1,1 Ch. 7 Pg 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, Representation of Turing machine Book :1,1 Ch. 9 Pg No.
278-279

Part 4
Week 10 Lecture 40 Representation of Turing machine Book :1,1 Ch. 9 Pg No. HomeWork 3 Submission
278-279
Week 11 Lecture 41 Design of Turing Machine Book :1,1 Ch. 9 Pg No. HomeWork 4 Allocation
284
Lecture 42 Design of Turing Machine

Lecture 43 Syntax Analysis: Ambiguity and the formal power Book :7,7 Ch 13 Pg
Series No.308
Lecture 44 Formal Properties of LL(k) Book :7,7 Ch 13 Pg Term Paper 1 Submission
No.314
Week 12 Lecture 45 Formal Properties of LR(k) Book :1,1 Ch 8 Pg
No.267

4 Approved for Spring Session 2010-11

 Week 12 Lecture 46 Derivation Language: Rewriting Systems Book :7,7 Ch 15 Pg
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 Submission
No.330
Lecture 50 Formal Language aspects Book :7,7 Ch 15 Pg
No.332
Lecture 51 Algebraic Properties Universality Book :7,7 Ch 15 Pg
No.335
Lecture 52 Complexity Book :7,7 Ch 15 Pg
Variants No.336

Spill Over
Week 14 Lecture 53 P and NP complete Problem, PCP(Post Book :1,1 Ch 12 Pg
Correspondence problem) no.349 & Ch 10 Pg
No.315
Lecture 54 Techniques for Turing Machine Construction, The Book :1,1 Ch 9
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
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*

5 Approved for Spring Session 2010-11

 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
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