Scribd Logo
Upload

Welcome to Scribd!

  • 3 views

    QP 1

    Uploaded by

    Nkul Iff

    Copyright:

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

    QP 1

    Uploaded by

    Nkul Iff
    3 views9 pages

    Original Title

    QP-1

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

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

    QP 1

    Uploaded by

    Nkul Iff

    Copyright:

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

    Pages: 1

    Total No. of Printed


    Roll No... ******"
    Total No. of Questions: 109|
    B.Tech. CSE (Semester -5th)
    AUTOMATA THEORY
    FORMAL LANGUAGE AND
    Subject Code: BCSES1503
    Paper 1D: 18111122

    Maximum Marks: 60
    Time: 03 Hours
    Instruction for candidates:
    marks each.
    Section A is compulsory. It consists of 10 parts of two attempt any 4
    each. The student has to
    2 Section B consist of 5 questions of 5 marks
    questions out of it.
    The student has to attempt any 2
    3. Section C consist of 3 questions of 10 marks each.
    questions.
    (2 marks each)
    Section-A
    Q1. Attempt the following:
    with respect to Finite Automata.
    a) Define language and alphabets
    b) What is formal aspect of Regular Language?
    c) State Arden's theorem for regular expressions. start and
    language which contain strings
    d) Construct a DFA over P ={a,b } that accept a

    "b' in-between.
    end with 'a' but have any number of
    Context Free Grammar.
    e) Describe various attributes of
    the Context Free Grammar?
    ) What are different steps to simplify
    context free grammar.
    g) Give an example of Ambiguity in to be in CNF (Chomsky
    h) Write down conditions of production rules for a grammar
    Normal Form)
    Machine?
    i) What is Universal Turing
    j) Define Closure property of CFL.

    Section - B 5 marks each)


    with help of an example.
    Q2. Define andExplain the Regular Expression Prove that the language a" b"', n20 is
    not a

    Q3. State Pumping Lemma for Regular Languages.


    the help of pumping lemma.
    Regular Language with conversion of language to
    Griebach Normal Form.
    for
    Q4. llustrate the various steps Derivation Tree.
    Context-Sensitive Language and
    Q5. Explain
    the tractability and In-tractability.
    Q6. Differentiate between
    Section C
    (10 marks each)

    P =
    {0,1} for the languages
    where all strings containing even
    DFA over
    Q7. (a) Design a

    number of zeros.
    in Chomsky hierarchy.
    (b) Describe the different types of grammar
    Palindrome over P {0,1} =

    Q8. (a) Design a


    Automata
    PushDown for Odd
    of Context Free Grammar
    (b) Describe different properities
    enumerable languages.
    Q9. (a)Explain recursively
    problem.
    (b) Explain the importance Satisfiability
    of

    You might also like