Scribd Logo
Upload

Welcome to Scribd!

  • 5 views

    UNIT 5- TOC- ASSIGNMENT QUESTIONS- SEM5 (1)

    Uploaded by

    Faizan Ahmad
    toc

    Copyright:

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

    UNIT 5- TOC- ASSIGNMENT QUESTIONS- SEM5 (1)

    Uploaded by

    Faizan Ahmad
    5 views2 pages
    toc

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    toc

    Copyright:

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

    UNIT 5- TOC- ASSIGNMENT QUESTIONS- SEM5 (1)

    Uploaded by

    Faizan Ahmad
    toc

    Copyright:

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

    GALGOTIAS UNIVERSITY

    SEM: V
    SUBJECT: THEORY OF COMPUTATION (E2UC501T)
    Unit: 5
    Assignment Questions

    1. Analyse the implications of the Halting Problem being undecidable for the design of
    real-world software systems.
    2. Compare and contrast the computational power of Linear Bounded Automata (LBA)
    and Turing Machines. Discuss how the restrictions of an LBA affect the types of
    languages it can recognize.
    3. Design a Turing machine for a specific recursively enumerable language and describe
    how you would prove its correctness. Discuss the limitations of your design in terms of
    decidability.
    4. Evaluate the impact of undecidable problems on the completeness and robustness of
    formal verification methods used in software engineering.
    5. Synthesize a proof to show that the language of all Turing machines that halt on a given
    input is not recursive. What assumptions and methods do you use in your proof?
    6. Critically assess the importance of the Chomsky Hierarchy in the context of language
    processing and compiler design. How do different levels of the hierarchy affect parsing
    strategies?
    7. Propose a new algorithm or method for approximating solutions to Post’s
    Correspondence Problem (PCP) and evaluate its effectiveness compared to existing
    approaches.
    8. Given a context-sensitive language, design a linear bounded automaton that recognizes
    it. Explain the steps taken to construct this LBA and discuss the complexity of the
    resulting machine.
    9. Investigate the relationship between context-free languages and context-sensitive
    languages in terms of language inclusions. Provide examples and proofs to support your
    investigation.
    10. Formulate and justify an argument about the limitations of universal Turing machines
    in practical computing scenarios, considering aspects such as resource constraints and
    time complexity.
    11. Develop a formal proof to show that the language of Turing machines that accept a
    specific set of inputs is not context-free. What techniques are used in your proof?
    12. Analyse how the undecidability of the Emptiness Problem impacts the development of
    automated tools for language analysis. What are the potential solutions or
    workarounds?
    13. Construct a context-free grammar for a language that is not regular. Show that this
    language cannot be recognized by a finite automaton and discuss the implications for
    automaton design.
    14. Evaluate different approaches to simulating a Turing machine with a Universal Turing
    Machine. Discuss the trade-offs in terms of efficiency and complexity.
    15. Design an experiment to test the limits of context-free languages in real-world
    applications, such as natural language processing. How would you measure and analyse
    the effectiveness of context-free grammars in these scenarios?

    You might also like