Scribd Logo
Upload

Welcome to Scribd!

  • 40 views

    Btech Cs 4 Sem Theory of Automata and Formal Languages ncs402 2018

    Uploaded by

    ATUL KUMAR YADAV
    This document contains instructions for a theory examination on automata and formal languages. It has 7 sections with a total of 100 marks. Section A contains 10 short answer questions worth 2 marks each. Section B contains 3 long answer questions worth 10 marks each. Sections C, D, E, F and G each contain 2 subparts with one to be answered worth 10 marks. The questions cover topics on finite automata, regular expressions, context-free languages, pushdown automata, Turing machines, and decidability.

    Copyright:

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

    Btech Cs 4 Sem Theory of Automata and Formal Languages ncs402 2018

    Uploaded by

    ATUL KUMAR YADAV
    40 views2 pages
    This document contains instructions for a theory examination on automata and formal languages. It has 7 sections with a total of 100 marks. Section A contains 10 short answer questions worth 2 marks each. Section B contains 3 long answer questions worth 10 marks each. Sections C, D, E, F and G each contain 2 subparts with one to be answered worth 10 marks. The questions cover topics on finite automata, regular expressions, context-free languages, pushdown automata, Turing machines, and decidability.

    Original Title

    btech-cs-4-sem-theory-of-automata-and-formal-languages-ncs402-2018

    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 contains instructions for a theory examination on automata and formal languages. It has 7 sections with a total of 100 marks. Section A contains 10 short answer questions worth 2 marks each. Section B contains 3 long answer questions worth 10 marks each. Sections C, D, E, F and G each contain 2 subparts with one to be answered worth 10 marks. The questions cover topics on finite automata, regular expressions, context-free languages, pushdown automata, Turing machines, and decidability.

    Copyright:

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

    Btech Cs 4 Sem Theory of Automata and Formal Languages ncs402 2018

    Uploaded by

    ATUL KUMAR YADAV
    This document contains instructions for a theory examination on automata and formal languages. It has 7 sections with a total of 100 marks. Section A contains 10 short answer questions worth 2 marks each. Section B contains 3 long answer questions worth 10 marks each. Sections C, D, E, F and G each contain 2 subparts with one to be answered worth 10 marks. The questions cover topics on finite automata, regular expressions, context-free languages, pushdown automata, Turing machines, and decidability.

    Copyright:

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

    Printed Pages:02 Sub Code: NCS402/CS404/ECS403

    Paper Id: 110403 Roll No.

    B. Tech.
    (SEM IV) THEORY EXAMINATION 2017-18
    THEORY OF AUTOMATA & FORMAL LANGUAGES
    Time: 3 Hours Total Marks: 100
    Note: 1. Attempt all Sections. If require any missing data; then choose suitably.

    SECTION A

    1. Attempt all questions in brief. 2 x 10 = 20


    a. Explain the applications and limitations of finite automata.
    b. Explain what modifications will be required to transform a Finite Automata
    model into Turing machine.
    c. What is MyHillNerode theorem? Explain.
    d. What is extended transition function*? Explain with example.
    e. Give the difference between Mealy and Moore machine.
    f. Define and give the difference between positive closure and Kleene closure.
    g. What in nondeterministic PDA? Explain with the help of transition function.
    h. Give the regular expression for set of all strings over {0,1} containing exactly
    three 0’s.
    i. Prove or disprove that union and concatenation of two context free languages
    is also context free.
    j. Explain recursively enumerable languages with example.

    SECTION B

    2. Attempt any three of the following: 10 x 3 = 30


    a. Explain the purpose of following FA:
    (q1, a) = q1, q2, (q1, b) = q3, ( q2, a) = q3, q2
    q1is initial state and F = {q2, q3}
    b. Let the languageof FA given below be L. Determine the FA accepting L(i.e.
    Complemented language).
    b
    a, b a b
    A B C D

    c. Prove that for all sets (i) ( S  )   S  , (ii) (S+)* =S*


    d. Prove that the language L = {anbncn|n≥0} is neither regular nor context free.
    e. Explain Church’s Thesis and prove that Halting problem of Turing machine is
    undecidable.
    SECTION C
    3. Attempt any one part of the following: 10 x 1 = 10
    (a) Give finite automata for:
    i) L = {anb2mc3l | n, m, l  0}.
    ii) L = {anb2m | 0 <n <3, m  0}.
    (b) Design DFA to accept all string over {0, 1} not ending with 10.

    4. Attempt any one part of the following: 10 x 1 = 10


    (a) Determine the language generated by grammar
    S Sab | aSb | abS| baS| bSa| Sba| aS| a
    (b) What is inherent ambiguity? Explain with the help of suitable example.

    5. Attempt any one part of the following: 10 x 1 = 10


    (a) Determine the grammar for language L = {anbm| n m}. Also explain the type
    of this language.
    (b) Construct context free grammar G corresponding to following context free
    language, then construct PDA corresponding to G
    L = { 0 n 12 n | n 1}

    6. Attempt any one part of the following: 10 x 1 = 10


    (a) Design PDA for language:
    L = {s (0, 1)* |number of 0’s and 1’s are not equal in every string of s}.
    (b) Construct a Turing machine to accept the language L = {anbncm| m, n 0}.

    7. Attempt any one part of the following: 10 x 1 = 10


    (a) Explain variations in Turing machine to make it more capable. How Universal
    Turing machine can be considered as model of digital computer?
    (b) Explain Modified Post Corresponding Problem. Does the following Post
    Corresponding Problem have a solution?
    A= (101, 100, 10, 0, 010), B = (10, 01, 0, 100, 1)

    You might also like