CSE321

Lovely Professional University, Phagwara

INSTRUCTIONAL PLAN (for Lectures)

Term: - 08092

Course No.:- CSE321 Course Title: - Automata Theory L: 4 T: 0 P: 0

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

Additional References: 2. Hopcroft, Motwani ,Ullman, “Introducation to Automata Theory, languages, & computation’, Pearson3. John C Martin, “Introduction to languages & the Theory of Computation” , TMG 4. G. E. Reevsz, Introduction to Formal Languages, McGraw Hill 19835. M. H. Harrison, Formal Language Theory Addison Wesley 1978.6. Wolfman Theory and Applications of Cellular Automata, World Scientists, Singapore,

Other readings:

S.No. Journal articles as compulsory readings (Complete reference)7. www.tik.ee.ethz.ch/tik/education/lectures/DES/Book/des_book_automata.pdf8. www.jalc.de< Journal of Automata , Languages and Combinatorics >

Relevant websites:S.No. Web address (Exact page address) Salient Features

9. www-cs-faculty.stanford.edu/~eroberts/courses/soco/projects/2004-05/automata-theory/basics.html

Automata Theory is an exciting, theoretical branch of computer science. It established its roots during the 20th Century, as mathematicians began developing ...

10. www.essaytown.com/coursework/automata _ theory _essays_papers.html

Provides Automata Theory coursework research papers, writing for Automata Theory school coursework essays, term paper help, book reports, college term

11. www.grlmc.com Research Group on Mathematical Linguistics

Detailed Plan for Lectures:

Plan for 12×L lectures: 6×L for before the MTE, 6×L for after the MTE. Provide for at least 2×L spill-over lecture.Lecture No.

Topic Chapters/ Sections of Textbook/ other reference1

Assignment/ Task to be assigned to students

Pedagogical aid Demonstration/ case study/ images/ animations etc.5

Date Delivered2

3 DoS4

1 Automata: Introduction & Definition

1,Ch. 3, Pg No. 71

TBA1

www.essaytown.com/coursework/

automata _ theory _essay s_papers.html

2-3 Description and transition mode.

1,Ch. 3, Pg No.73,74



4-5 NFA and DFA, 1,Ch. 3, Pg No. 80


automata _ theory _essay

http://www.essaytown.com/coursework/automata_theory_essays_papers.html








http://www.grlmc.com/



s_papers.html6-7 Mealy and Moore machine 1,Ch. 3,

Pg No. 84-87



8-9 Minimization of Automata. 1,Ch. 3, Pg No. 91



10-11 Formal Languages: Languages and their relation

1,Ch. 4, Pg No. 123

TBA2

www.tik.ee.ethz.ch/tik/education/lectures/

DES/Book/des_book_automata.pdf

12-13 Chomsky classification of languages

1,Ch. 4, Pg No. 120

www.jalc.de< Journal of Automata , Languages and

Combinatorics >

14-15 Linear Grammars and regular Languages.

1,Ch. 4, Pg No. 107-110



16-17 Regular Expressions, Context Sensitive Language.

1,Ch. 5, Pg No.136-138

TBA3


Combinatorics >

18-19 Construction of Finite Automata equivalent to Regular expression & vice versa,

1,Ch. 5, Pg No. 140-160



20-22 Pumping Lemma for regular sets & its applications

1,Ch. 5, Pg No.162-165


Combinatorics >

23-24 Context Free languages: Derivation trees,

1,Ch. 6, Pg No. 180-181

TBA4


Combinatorics >

25-26 Ambiguity in Context free grammars,

1,Ch. 6, Pg No. 188

www-cs-faculty.stanford.edu/

~eroberts/courses/soco/projects/2004-05/automata-theory/basics.html

27-28 Simplification of context free grammars,

1,Ch. 6, Pg No.190-200



29 The Chomsky Normal Forms

1,Ch. 6, Pg No. 201-205










30-31 The Greibach Normal Forms 1, Ch. 6, Pg No. 206-212



32 The Kuroda Normal Form 1,Ch. 6 www.jalc.de< Journal of Automata , Languages and

Combinatorics >33 One sided Context Sensitive

Grammars.Unrestricted Languages:

1, Ch. 6

TBA5


Combinatorics >

34-35 Automata and their Languages: Finite Pushdown 2-push down Automata


Combinatorics >

36-37 Turing Machines 1, Ch. 9, Pg No. 278


Combinatorics >

38 Syntax Analysis : Ambiguity and the formal power Series,

1,Ch. 9 www.grlmc.com

39-40 Formal Properties of LL(k) and LR(k) Grammars

1,Ch. 8, Pg No. 267-272



41-42 Derivation Languages; Rewriting Systems,

Ref No.2 www.jalc.de< Journal of Automata , Languages and

Combinatorics >43-44 Algebraic properties,

Canonical Derivations,Ref No.2 www.grlmc.com

45-46 Cellular Automata : Formal Language aspects,

Ref No.6 www.jalc.de< Journal of Automata , Languages and

Combinatorics >47-48 Algebraic Properties

Universality & Complexity Variants

Ref No.6 www.grlmc.com

Additional material for spill over (for at least 2XL lectures)

Notes: 1. Use S. No. Of the readings above2. To be filled in on the date of delivery of lecture by the instructor3. Put assignment number from Assignment Table (below) against the lecture in which planned to be assigned (by co-

ordinator)4. To be filled in on the date of assignment (by the instructor)5. Do not write Lecture, OHP, LCD projector etc.




Details of Assignments Planned:Assignment No.

Details Nature of Assignment

Expected outcome Date of Allocation

Date of Submission

1 Finite automata (DFA & NDFA), Mealy & Moore Machine

GR

OU

P

To understand the power and limitations of FSM, Behaviour of different machine by rigorous methods

3rd Week 4th Week

2 Formal Language, Linear Language & Regular Language & its expression

Understand formal, linear &regular language

4th Week 5th Week

3 Construction of Finite Automata

Knowledge about regular expressions & Simplification of regular sets

6th Week 7th Week

4 Context Free Languages, Normal Forms, Automata & their Languages

Designing knowledge, Machine Behaviour & working knowledge

9th Week 10th Week

5 Turing Machine, Syntax Analysis, Derivation Languages

Challenging problems & knowledge about latest problems

11th Week 12th Week

_______________________

Prepared by (Course Coordinator)

Comments of HoD

Signature & Date

Comments of HoS

Signature & DateSyllabus coverage by one week before MTE

Satisfactory/ lagging by ____ lectures.Signature of HoD & Date

Syllabus coverage by two weeks before E TE

Satisfactory/ lagging by ____ lectures.Signature of HoD & Date

**Attach detailed assignments and list of suggested topics for term-papers

Documents

CSE321