Lovely Professional University,Punjab Format For Instruction Plan [for Courses with Lectures and Labs
Course No
Cours Title
Course Planner
CSE321
AUTOMATA THEORY
13742 :: Mandeep Singh
Text Book:
Other Specific Book:
Lectures Tutorial Practical
1 K.L.P Mishra & N. Chandrasekran, Theory of Computer Science :Automata, languages & Computation, PHI.
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 Combinatorics > 9 www.tik.ee.ethz.ch/tik/education www.tik.ee.ethz.ch/tik/education/lectures/DES/Book/des_book_aut /lectures/DES/Book/des_book_automata.pdf omata.pdf
Relevant Websites
4
0
Credits 0
4
Sr. No. (Web adress) (only if relevant to the courses)
Salient Features
10 www-csfaculty.stanford.edu/~eroberts/courses/soco/projects/200405/automata-theory/basics.html
Provides information about basics of automata theory
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
Week 2
Week 3
Lecture 1
Introduction to Finite Automata
Book :1,1 Ch 3 Pg No.71-72
http://users.ece.utexas.e du/~adnan/verif04/fsa.pdf
Lecture 2
Description of FA
Book :1,1 Ch. 3 Pg No. 73
www.baylor.edu/content/ services/document.php/ 59577.ppt
Lecture 3
Transition systems and its properties, acceptability of a string by a FA
Book :1,1 Ch. 3 Pg No.74
Lecture 4
DFA and NDFA
Book :1,1 Ch. 3 Pg No.78
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. 80
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
Lecture 9
Minimization of Finite Automata
Lecture 10
Minimization of Finite Automata
Book :1,1 Ch. 3 Pg No. 91
web.cecs.pdx.edu/.../LE CTURE_A_4.Equivalenc e.NDFA.DFA.ppt
Week 3
Week 4
Lecture 11
Formal languages, basic definitions and examples
Book :1,1 Ch. 4 Pg No. 107
http://www.ces.clemson. edu/~warner/M865/auto mata/FormalLanguages. pdf
Lecture 12
Chomsky classification of languages
Book :1,1 Ch. 4 Pg No. 120
Lecture 13
Chomsky classification of languages
Book :1,1 Ch. 4 Pg No. 120
Lecture 14
Languages and their relations, Recursive and recursive enumerable sets
Book :1,1 Ch. 4 Pg No. 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
Lecture 17
Linear Grammars and regular Languages
Lecture 18
Regular Expression and Regular sets
Lecture 19
Regular Expression and Regular sets
Lecture 20
Construction of Regular expression equivalent to Finite Automata
Book :1,1 Ch. 5 Pg No. 140-148
Lecture 21
Construction of Regular expression equivalent to Finite Automata using Arden's theorem
Book :1,1 Ch. 5 Pg No. 140-148
Lecture 22
Construction of Finite Automata equivalent to Regular expression
Book :1,1 Ch. 5 Pg No. 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
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
Part 2 Week 4
Week 5
Week 6
Week 7
HomeWork 1 Submission Book :1,1 Ch. 5 Pg No. HomeWork 2 Allocation 136-141
Book :1,1 Ch. 6 Pg No. 188
www.cs.rpi.edu/~moorth y/.../Regular_Grammars. ppt
MID-TERM Part 3 Week 8
Week 9
Week 10
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 No.206
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, Unrestricted Languages
Book :7,7 Ch 12 Pg No.301
Lecture 36
Finite Push Down Automata
Book :1,1 Ch. 7 Pg No. 227
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
HomeWork 3 Allocation
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 Series
Book :7,7 Ch 13 Pg No.308
Lecture 44
Formal Properties of LL(k)
Book :7,7 Ch 13 Pg No.314
Lecture 45
Formal Properties of LR(k)
Book :1,1 Ch 8 Pg No.267
Week 12
Term Paper 1 Submission
Week 12
Week 13
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
Lecture 49
Cellular Automata
Book :7,7 Ch 15 Pg 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 Variants
Book :7,7 Ch 15 Pg No.336
Lecture 53
P and NP complete Problem, PCP(Post Correspondence problem)
Book :1,1 Ch 12 Pg no.349 & Ch 10 Pg No.315
Lecture 54
Techniques for Turing Machine Construction, The Model of Linear Bounded Automata
Book :1,1 Ch 9
HomeWork 4 Submission
Spill Over Week 14
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*
Component
Frequency
Out Of
Term Paper
1
Homework
3
Class test based on homework
3 Total :-
Each Marks Total Marks 25
25
4
7
21
4
18
54
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