Scribd Logo
Importer

Bienvenue sur Scribd !

  • Automata Theory Course Code CSE321

    Transféré par

    Prabhat Kumar Pankaj
    5 vues2 pages
    This document outlines a course on Automata Theory. The course objectives are to impart concepts of the theory of computation, which deals with determining if and how efficiently problems can be solved on computers. The prerequisites listed are various data structure courses. The course contents cover topics like automata, formal languages, regular expressions, context-free grammars, pushdown automata, Turing machines, and cellular automata. Recommended textbooks and additional readings are provided, along with salient pedagogical features like closing quizzes, drill problems, recent trends topics, and use of animations and case studies.

    Description originale:

    imp

    Titre original

    SCSE321

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Formats disponibles

    DOC, PDF, TXT ou lisez en ligne sur Scribd

    Avez-vous trouvé ce document utile ?

    Ce contenu est-il inapproprié ?

    Signaler ce document
    This document outlines a course on Automata Theory. The course objectives are to impart concepts of the theory of computation, which deals with determining if and how efficiently problems can be solved on computers. The prerequisites listed are various data structure courses. The course contents cover topics like automata, formal languages, regular expressions, context-free grammars, pushdown automata, Turing machines, and cellular automata. Recommended textbooks and additional readings are provided, along with salient pedagogical features like closing quizzes, drill problems, recent trends topics, and use of animations and case studies.

    Droits d'auteur :

    Attribution Non-Commercial (BY-NC)
    Téléchargez comme DOC, PDF, TXT ou lisez en ligne sur Scribd
    Signaler comme contenu inapproprié
    5 vues2 pages

    Automata Theory Course Code CSE321

    Transféré par

    Prabhat Kumar Pankaj
    This document outlines a course on Automata Theory. The course objectives are to impart concepts of the theory of computation, which deals with determining if and how efficiently problems can be solved on computers. The prerequisites listed are various data structure courses. The course contents cover topics like automata, formal languages, regular expressions, context-free grammars, pushdown automata, Turing machines, and cellular automata. Recommended textbooks and additional readings are provided, along with salient pedagogical features like closing quizzes, drill problems, recent trends topics, and use of animations and case studies.

    Droits d'auteur :

    Attribution Non-Commercial (BY-NC)
    Téléchargez comme DOC, PDF, TXT ou lisez en ligne sur Scribd
    Signaler comme contenu inapproprié
    sur 2

    COURSE

    CODE

    COURSE
    TITLE

    AUTOMATA THEORY
    WEIGHTAGES
    CA

    CREDITS
    (or Max. Marks)

    MTE

    ETE

    Attd.

    AT

    Th

    Th

    20

    25

    50

    COURSE OBJECTIVES:
    The theory of computation is the branch of computer science that deals with whether and how efficiently
    problems can be solved on a computer. In order to perform a rigorous study of computation, computer scientists
    work with a mathematical abstractions of computer The purpose of this course is to impart concepts of Theory
    of Computation.
    PRE-REQUISITES:
    CSE204: Fundamental of Data Structure
    CSE205: Data Structure
    CSE2050: Data Structure
    CSE255: Data Structure & Algorithms

    or
    or
    or

    COURSE CONTENTS:
    S. No.
    1

    Description
    Automata: Definition and description and transition mode.
    NFA and DFA, Mealy and Moore machine, Minimization of Automata.

    Formal Languages: Languages and their relation, Chomsky classification of languages .

    Linear Grammars and regular Languages. Regular Expressions, Context Sensitive Language .

    4
    5

    Construction of Finite Automata equivalent to Regular expression & vice versa, Pumping
    Lemma for regular sets & its applications.
    Context Free languages: Derivation trees, Ambiguity in Context free grammars.

    MTE
    Simplification of context free grammars, The Chomsky & Griebach Normal Forms.The Kuroda
    Normal Form, One sided Context Sensitive Grammars, Unrestricted Languages:
    Automata and their Languages: Finite Pushdown 2-push down Automata and Turing Machines

    Syntax Analysis : Ambiguity, Formal Properties of LL(k) and LR(k) Grammars.

    Derivation Languages; Rewriting Systems, Algebraic properties, Canonical Derivations.

    10

    Cellular Automata: Formal Language aspects

    TEXT BOOKS:
    1. K.L.P Mishra & N. Chandrasekran, Theory of Computer Science :Automata, languages & Computation,
    PHI.
    OTHER READINGS:
    1.
    2.
    3.
    4.
    5.

    Hopcroft, Motwani ,Ullman, Introducation to Automata Theory, languages, & computation, Pearson.
    John C Martin, Introduction to languages & the Theory of Computation , TMG .
    G. E. Reevsz, Introduction to Formal Languages, McGraw Hill 1983.
    M. H. Harrison, Formal Language Theory Addison Wesley 1978.
    Wolfman Theory and Applications of Cellular Automata, World Scientists, Singapore.

    SALIENT PEDAGOGICAL FEATURES:


    1. Closing Quiz/Review Quiz.
    2. Drill Problems based on real life
    scenarios.
    3. Recent Trends Topics.

    1. Use of Animations and Case Studies.

    Vous aimerez peut-être aussi