Scribd Logo
Upload

Welcome to Scribd!

  • 36 views

    TOC Syllabus

    Uploaded by

    vivek common
    This document provides information about the Theory of Computation course (CS303T). It is a 3 credit core course offered to B.Tech students with no prerequisites. The course aims to provide a formal connection between algorithmic problem solving and the theory of languages and automata. Key topics include finite state machines, regular expressions, context-free grammars, pushdown automata, Turing machines, and complexity classes like P, NP, NP-complete. The course outcomes are understanding different computational models, applying formal methods to languages/grammars, identifying limitations, applying models to compiler design, and understanding solvability.

    Copyright:

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

    TOC Syllabus

    Uploaded by

    vivek common
    36 views2 pages
    This document provides information about the Theory of Computation course (CS303T). It is a 3 credit core course offered to B.Tech students with no prerequisites. The course aims to provide a formal connection between algorithmic problem solving and the theory of languages and automata. Key topics include finite state machines, regular expressions, context-free grammars, pushdown automata, Turing machines, and complexity classes like P, NP, NP-complete. The course outcomes are understanding different computational models, applying formal methods to languages/grammars, identifying limitations, applying models to compiler design, and understanding solvability.

    Original Description:

    Modeling Risk and Realities: Syllabus

    Original Title

    TOC syllabus

    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 provides information about the Theory of Computation course (CS303T). It is a 3 credit core course offered to B.Tech students with no prerequisites. The course aims to provide a formal connection between algorithmic problem solving and the theory of languages and automata. Key topics include finite state machines, regular expressions, context-free grammars, pushdown automata, Turing machines, and complexity classes like P, NP, NP-complete. The course outcomes are understanding different computational models, applying formal methods to languages/grammars, identifying limitations, applying models to compiler design, and understanding solvability.

    Copyright:

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

    TOC Syllabus

    Uploaded by

    vivek common
    This document provides information about the Theory of Computation course (CS303T). It is a 3 credit core course offered to B.Tech students with no prerequisites. The course aims to provide a formal connection between algorithmic problem solving and the theory of languages and automata. Key topics include finite state machines, regular expressions, context-free grammars, pushdown automata, Turing machines, and complexity classes like P, NP, NP-complete. The course outcomes are understanding different computational models, applying formal methods to languages/grammars, identifying limitations, applying models to compiler design, and understanding solvability.

    Copyright:

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

    Course Title Theory of Course Number CS303T

    Computation
    Department Computer Science Structure (I-P-C) 3-0-3
    and Engineering
    Offered To B. Tech. Status Core
    (Core/Elective)
    Prerequisite NA Effective From July 2020
    Course Aim Course will provide a formal connection between algorithmic
    problem solving and the theory of languages and automata and
    develop them into a mathematical view towards algorithmic design
    and in general computation itself.
    Course Outcomes 1. Understand, compare and analyse different computational models
    and the language it accepts.
    2. Apply formal mathematical methods to prove properties of
    languages and grammars.
    3. Identify limitations of some computational models and possible
    methods of proving them.
    4. Application of computational models for designing various
    phases of compilers.
    5. Understand the notion of solvable, NP, NP-hard, NP-complete,
    decidable, undecidable languages.
    Contents of the Module – I
    Course
    Introduction: Notion of formal language- Strings, Alphabet,
    Language, Operations, Finite State Machine, definitions, finite
    automaton model, acceptance of strings and languages, deterministic
    finite automaton, equivalence between NFA and DFA, Conversion of
    NFA into DFA, minimization of FSM, equivalence between two
    FSM's, Moore and Mealy machines. Regular expressions: Regular
    sets, regular expressions, identity rules, manipulation of regular
    expressions, equivalence between RE and FA, inter conversion,
    Pumping lemma, Closure properties of regular sets regular grammars,
    right linear and left linear grammars equivalence between regular
    linear grammar and FA, inter conversion between RE and RG.

    Module - II

    Context free grammars: Derivation, parse trees. Language generated


    by a CFG. Eliminating useless symbols, -productions, and unit
    productions. Chomsky Normal Form. Pushdown automata:
    Definition, instantaneous description as a snapshot of PDA
    computation, notion of acceptance for PDAs. Pumping lemma for
    30 | P a g e
    context free languages.

    Module - III

    Turing machine: Turing machine, definition, model, design of TM,


    Computable Functions, recursive enumerable language, Church’s
    Hypothesis, Counter machine, types of TM's, RAM machine

    Module – IV

    Un-decidability and classes of problems: Chomsky hierarchy of


    languages, linear bounded automata and context sensitive language,
    Grammar, decidability of problems, Universal Turing Machine, un-
    decidability of post’s correspondence problem. Turing reducibility
    logical theories Complexity classes: P, NP, co-NP, NP-Hard, NP-
    Complete, EXP, PSPACE.
    References 1. J Hopcroft, JD Ullman and R Motwani, Introduction to Automata
    Theory, Languages and Computation, Third Edition, Pearson,
    2008.
    2. M Sipser, Introduction to the Theory of Computation, Second
    Edition, Thomson, 2005.
    3. Lewis H.P. and Papadimition C.H. Elements of Theory of
    Computation, Prentice Hall of India, Fourth Edition, 2007.
    4. S. Arora and B. Barak, Computational Complexity: A Modern
    Approach, Cambridge University Press, 2009.
    5. C. H. Papadimitriou, Computational Complexity, Addison-
    Wesley Publishing Company, 1994.
    6. D. C. Kozen, Theory of Computation, Springer, 2006.
    7. D. S. Garey and G. Johnson, Computers and Intractability: A
    Guide to the Theory of NP- Completeness, Freeman, New York,
    1979.

    31 | P a g e

    You might also like