Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 140 views

    CSE321

    Uploaded by

    Manoj Sharma
    Automata Theory is an exciting, theoretical branch of computer science. Established its roots during the 20th century, as mathematicians began developing machines. Provides Automata Theory coursework research papers, writing for Automata Theory school coursework essays, term paper help, book reports, college term.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd

    CSE321

    Uploaded by

    Manoj Sharma
    140 views4 pages
    Automata Theory is an exciting, theoretical branch of computer science. Established its roots during the 20th century, as mathematicians began developing machines. Provides Automata Theory coursework research papers, writing for Automata Theory school coursework essays, term paper help, book reports, college term.

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Automata Theory is an exciting, theoretical branch of computer science. Established its roots during the 20th century, as mathematicians began developing machines. Provides Automata Theory coursework research papers, writing for Automata Theory school coursework essays, term paper help, book reports, college term.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    140 views4 pages

    CSE321

    Uploaded by

    Manoj Sharma
    Automata Theory is an exciting, theoretical branch of computer science. Established its roots during the 20th century, as mathematicians began developing machines. Provides Automata Theory coursework research papers, writing for Automata Theory school coursework essays, term paper help, book reports, college term.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    You are on page 1of 4

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

    Other readings: S.No. 7. 8. Journal articles as compulsory readings (Complete reference) www.tik.ee.ethz.ch/tik/education/lectures/DES/Book/des_book_automata.pdf www.jalc.de< Journal of Automata, Languages and Combinatorics > Salient Features Automata Theory is an exciting, theoretical branch of computer science. It established its roots during the 20th Century, as mathematicians began developing ... Provides Automata Theory coursework research papers, writing for Automata Theory school coursework essays, term paper help, book reports, college term Research Group on Mathematical Linguistics

    Relevant websites: S.No. Web address (Exact page address) 9. www-csfaculty.stanford.edu/~eroberts/courses /soco/projects/2004-05/automatatheory/basics.html 10. www.essaytown.com/coursework/aut omata_theory_essays_papers.html 11. www.grlmc.com

    Detailed Plan for Lectures:


    Plan for 12L lectures: 6L for before the MTE, 6L for after the MTE. Provide for at least 2L spill-over lecture. Lecture Topic Chapters/ Assignment/ Pedagogical aid Date No. Sections of Task to be Demonstration/ case study/ Delivered2 Textbook/ assigned to images/ animations etc.5 other students reference1 3 DoS
    4

    1 2-3 4-5 6-7

    Automata: Introduction & Definition

    1,Ch. 3, Pg No. 71

    Description and transition 1,Ch. 3, mode. Pg No.73,74 NFA and DFA, 1,Ch. 3, Pg No. 80 Mealy and Moore machine 1,Ch. 3, Pg No. 84-87

    TBA1

    www.essaytown.com/co ursework/automata_the ory_essays_papers.html www.essaytown.com/co ursework/automata_the ory_essays_papers.html www.essaytown.com/co ursework/automata_the ory_essays_papers.html www.essaytown.com/co ursework/automata_the ory_essays_papers.html

    8-9 10-11

    Minimization of Automata. Formal Languages: Languages and their relation

    1,Ch. 3, Pg No. 91 1,Ch. 4, Pg No. 123 TBA2

    12-13 14-15

    Chomsky classification of 1,Ch. 4, languages Pg No. 120 Linear Grammars and 1,Ch. 4, regular Languages. Pg No. 107-110 Regular Expressions, 1,Ch. 5, Context Sensitive Language. Pg No.136138 Construction of Finite 1,Ch. 5, Automata equivalent to Pg No. Regular expression & vice 140-160 versa, Pumping Lemma for regular 1,Ch. 5, sets & its applications Pg No.162165 Context Free languages: 1,Ch. 6, Derivation trees, Pg No. 180-181 Ambiguity in Context free 1,Ch. 6, grammars, Pg No. 188 Simplification of context free grammars, 1,Ch. 6, Pg No.190200 1,Ch. 6, Pg No. 201-205

    www.essaytown.com/co ursework/automata_the ory_essays_papers.html www.tik.ee.ethz.ch/tik/ed ucation/lectures/DES/Bo ok/des_book_automata. pdf www.jalc.de< Journal of


    Automata, Languages and Combinatorics >

    16-17

    www.tik.ee.ethz.ch/tik/ed ucation/lectures/DES/Bo ok/des_book_automata. pdf www.jalc.de< Journal of


    Automata, Languages and Combinatorics >

    18-19

    TBA3

    20-22

    www.tik.ee.ethz.ch/tik/ed ucation/lectures/DES/Bo ok/des_book_automata. pdf www.jalc.de< Journal of


    Automata, Languages and Combinatorics >

    23-24 25-26

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

    27-28

    TBA4

    29

    The Chomsky Normal Forms

    30-31

    The Greibach Normal Forms 1, Ch. 6, Pg No. 206-212 The Kuroda Normal Form One sided Context Sensitive 1,Ch. 6 1, Ch. 6

    32 33

    www-csfaculty.stanford.edu/~er oberts/courses/soco/proj ects/2004-05/automatatheory/basics.html www-csfaculty.stanford.edu/~er oberts/courses/soco/proj ects/2004-05/automatatheory/basics.html www-csfaculty.stanford.edu/~er oberts/courses/soco/proj ects/2004-05/automatatheory/basics.html www-csfaculty.stanford.edu/~er oberts/courses/soco/proj ects/2004-05/automatatheory/basics.html www.jalc.de< Journal of
    Automata, Languages and Combinatorics > www.jalc.de< Journal of

    34-35

    36-37 38 39-40

    Grammars. Unrestricted Languages: Automata and their Languages: Finite Pushdown 2-push down Automata Turing Machines

    Automata, Languages and Combinatorics >

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

    Syntax Analysis : Ambiguity and the formal power Series, Formal Properties of LL(k) 1,Ch. 8, and LR(k) Grammars Pg No. 267-272 Derivation Languages; Rewriting Systems,

    1, Ch. 9, Pg No. 278 1,Ch. 9 TBA5

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

    www.grlmc.com www-csfaculty.stanford.edu/~er oberts/courses/soco/proj ects/2004-05/automatatheory/basics.html www.jalc.de< Journal of


    Automata, Languages and Combinatorics >

    41-42 43-44 45-46 47-48

    Ref No.2

    Algebraic properties, Ref No.2 Canonical Derivations, Cellular Automata : Formal Ref No.6 Language aspects, Algebraic Properties Ref No.6 Universality & Complexity Variants

    www.grlmc.com www.jalc.de< Journal of


    Automata, Languages and Combinatorics >

    www.grlmc.com

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

    Notes: 1. Use S. No. Of the readings above 2. To be filled in on the date of delivery of lecture by the instructor 3. Put assignment number from Assignment Table (below) against the lecture in which planned to be assigned (by coordinator) 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: Assign ment No. 1 Details Finite automata (DFA & NDFA), Mealy & Moore Machine Formal Language, Linear Language & Regular Language & its expression Construction of Finite Automata Context Free Languages, Normal Forms, Automata & their Languages Turing Machine, Syntax Analysis, Derivation Languages Nature of Assignment GROUP Expected outcome To understand the power and limitations of FSM, Behaviour of different machine by rigorous methods Understand formal, linear &regular language Date of Allocation 3rd Week Date of Submission 4th Week

    4th Week

    5th Week

    3 4

    Knowledge about regular 6th Week expressions & Simplification of regular sets Designing knowledge, 9th Week Machine Behaviour & working knowledge Challenging knowledge problems problems & 11th Week about latest

    7th Week 10th Week

    12th Week

    _______________________
    Prepared by (Course Coordinator)

    Comments of HoD Signature & Date Comments of HoS Signature & Date

    Syllabus 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

    You might also like