Scribd Logo
Upload

Welcome to Scribd!

  • Assignment TOC

    Uploaded by

    Yashika Sengar
    9 views2 pages
    This document contains a quiz for a course on Theory of Computation. It lists 11 questions covering topics in finite automata, pushdown automata, Turing machines, and complexity classes. The questions ask students to convert between different machine models, construct machines to recognize specific languages, and explain relationships between complexity classes. The document provides a coding system to track which learning outcomes each question addresses.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains a quiz for a course on Theory of Computation. It lists 11 questions covering topics in finite automata, pushdown automata, Turing machines, and complexity classes. The questions ask students to convert between different machine models, construct machines to recognize specific languages, and explain relationships between complexity classes. The document provides a coding system to track which learning outcomes each question addresses.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    9 views2 pages

    Assignment TOC

    Uploaded by

    Yashika Sengar
    This document contains a quiz for a course on Theory of Computation. It lists 11 questions covering topics in finite automata, pushdown automata, Turing machines, and complexity classes. The questions ask students to convert between different machine models, construct machines to recognize specific languages, and explain relationships between complexity classes. The document provides a coding system to track which learning outcomes each question addresses.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    LAKSHMI NARAIN COLLEGE OF TECHNOLOGY, BHOPAL

    DEPARTMENT OF CSE-DATA SCIENCE & ENGINEERING


    QUIZ/ASSIGNMENTS SHEETS (CO-BASED)
    B.TECH. – V SEMESTER (CSE-DATA SCIENCE)
    CS-501 THEORY OF COMPUTATION [CS-501]
    1. Convert the following Mealy machine into equivalent Moore machine. (C0 1)

    2. Convert following Moore machine to Mealy machine (C0 1)

    3. Construct a Finite Automata which accept all strings over ∑{a,b} ended with ‘abb’ (C0 2)
    4. Construct a Finite Automata which accept all strings over ∑ {a,b} contain ‘aba’ (C0 2)
    5. Convert the following epsilon NFA to equivalent DFA (C0 2)

    6. Convert the following CFG to CNF. (C0 3)

    7. Convert following LLG to FA. (C0 3)


    8. Design a PDA for accepting a language {a n b 2n | n>=1}. (C0 4)
    9. Construct a PDA for language L={a n ,b n | n>=1}. (C0 4)
    10. Construct a Turing machine for the language L = {a n b n c n } where n≥1. (C0 5)
    11. Relation between P, NP, NP hard and NP complete. (C0 5)

    You might also like