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

Welcome to Scribd!

  • 138 views

    II Year - II Semester L T P C 4 0 0 3

    Uploaded by

    Viswanadh Jvs
    This document outlines the course objectives and units for a course on Formal Language and Automata Theory. The course introduces students to the concepts of theory of computation including finite automata, regular expressions, context-free grammars, pushdown automata, Turing machines, and computability. The six units cover these topics as well as design of machines, language recognition, and applications. The outcomes are for students to classify machines by their power to recognize languages and understand the hierarchy of computational problems.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    II Year - II Semester L T P C 4 0 0 3

    Uploaded by

    Viswanadh Jvs
    138 views2 pages
    This document outlines the course objectives and units for a course on Formal Language and Automata Theory. The course introduces students to the concepts of theory of computation including finite automata, regular expressions, context-free grammars, pushdown automata, Turing machines, and computability. The six units cover these topics as well as design of machines, language recognition, and applications. The outcomes are for students to classify machines by their power to recognize languages and understand the hierarchy of computational problems.

    Original Description:

    Engineering Flat jntuk syllabus

    Original Title

    Flat

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document outlines the course objectives and units for a course on Formal Language and Automata Theory. The course introduces students to the concepts of theory of computation including finite automata, regular expressions, context-free grammars, pushdown automata, Turing machines, and computability. The six units cover these topics as well as design of machines, language recognition, and applications. The outcomes are for students to classify machines by their power to recognize languages and understand the hierarchy of computational problems.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    138 views2 pages

    II Year - II Semester L T P C 4 0 0 3

    Uploaded by

    Viswanadh Jvs
    This document outlines the course objectives and units for a course on Formal Language and Automata Theory. The course introduces students to the concepts of theory of computation including finite automata, regular expressions, context-free grammars, pushdown automata, Turing machines, and computability. The six units cover these topics as well as design of machines, language recognition, and applications. The outcomes are for students to classify machines by their power to recognize languages and understand the hierarchy of computational problems.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    L T P C

    II Year – II Semester
    4 0 0 3
    FORMAL LANGUAGE AND AUTOMATA THEORY

    OBJECTIVE:
    • Introduce the student to the concepts of Theory of computation in computer science
    • The students should acquire insights into the relationship among formal languages,
    formal Grammars and automat.

    UNIT – I: Finite Automata


    Why Study Automata Theory? The Central Concepts of Automata Theory, Automation, Finite
    Automation, Transition Systems, Acceptance of a String by a Finite Automation, DFA, Design
    of DFAs, NFA, Design of NFA, Equivalence of DFA and NFA, Conversion of NFA into DFA,
    Finite Automata with E-Transition, Minimization of Finite Automata, Mealy and Moore
    Machines, Applications and Limitation of Finite Automata.

    UNIT – II: Regular Expressions


    Regular Expressions, Regular Sets, Identity Rules, Equivalence of two Regular Expressions,
    Manipulations of Regular Expressions, Finite Automata, and Regular Expressions, Inter
    Conversion, Equivalence between Finite Automata and Regular Expressions, Pumping Lemma,
    Closers Properties, Applications of Regular Expressions, Finite Automata and Regular
    Grammars, Regular Expressions and Regular Grammars.

    UNIT – III: Context Free Grammars


    Formal Languages, Grammars, Classification of Grammars, Chomsky Hierarchy Theorem,
    Context Free Grammar, Leftmost and Rightmost Derivations, Parse Trees, Ambiguous
    Grammars, Simplification of Context Free Grammars-Elimination of Useless Symbols, E-
    Productions and Unit Productions, Normal Forms for Context Free Grammars-Chomsky Normal
    Form and Greibach Normal Form, Pumping Lemma, Closure Properties, Applications of Context
    Free Grammars.

    UNIT – IV: Pushdown Automata


    Pushdown Automata, Definition, Model, Graphical Notation, Instantaneous Description
    Language Acceptance of pushdown Automata, Design of Pushdown Automata, Deterministic
    and Non – Deterministic Pushdown Automata, Equivalence of Pushdown Automata and
    Context Free Grammars Conversion, Two Stack Pushdown Automata, Application of Pushdown
    Automata.

    UNIT – V: Turning Machine


    Turing Machine, Definition, Model, Representation of Turing Machines-Instantaneous
    Descriptions, Transition Tables and Transition Diagrams, Language of a Turing Machine,
    Design of Turing Machines, Techniques for Turing Machine Construction, Types of Turing
    Machines, Church’s Thesis, Universal Turing Machine, Restricted Turing Machine.
    UNIT – VI: Computability
    Decidable and Un-decidable Problems, Halting Problem of Turing Machines, Post’s
    Correspondence Problem, Modified Post’s Correspondence Problem, Classes of P and NP, NP-
    Hard and NP-Complete Problems.

    OUTCOMES:
    • Classify machines by their power to recognize languages,
    • Employ finite state machines to solve problems in computing,
    • Explain deterministic and non-deterministic machines,
    • Comprehend the hierarchy of problems arising in the computer science

    TEXT BOOKS:
    1. Introduction to Automata Theory, Languages and Computation, J.E.Hopcroft, R.Motwani and
    J.D.Ullman, 3rd Edition, Pearson, 2008.
    2. Theory of Computer Science-Automata, Languages and Computation, K.L.P.Mishra and
    N.Chandrasekharan, 3rd Edition, PHI, 2007.

    REFERENCE BOOKS:
    1. Formal Language and Automata Theory, K.V.N.Sunitha and N.Kalyani, Pearson, 2015.
    2. Introduction to Automata Theory, Formal Languages and Computation, Shyamalendu Kandar,
    Pearson, 2013.
    3. Theory of Computation, V.Kulkarni, Oxford University Press, 2013.
    4. Theory of Automata, Languages and Computation, Rajendra Kumar, McGraw Hill, 2014.

    You might also like