Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 55 views

    B.Tech. Degree Examination Cse & It: (Nov-12) (EURCS-505/EURIT-505)

    Uploaded by

    VishalChakraraj
    This document contains the details of a degree examination for a formal languages and automata theory course. It includes 10 questions across 5 units that cover topics like finite automata, regular expressions, context-free grammars, pushdown automata, Turing machines, and the Post correspondence problem. Students must answer all parts of 3 questions, selecting one question from each unit, within the allotted time of 3 hours.

    Copyright:

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

    B.Tech. Degree Examination Cse & It: (Nov-12) (EURCS-505/EURIT-505)

    Uploaded by

    VishalChakraraj
    55 views3 pages
    This document contains the details of a degree examination for a formal languages and automata theory course. It includes 10 questions across 5 units that cover topics like finite automata, regular expressions, context-free grammars, pushdown automata, Turing machines, and the Post correspondence problem. Students must answer all parts of 3 questions, selecting one question from each unit, within the allotted time of 3 hours.

    Original Description:

    FLAT NOTES

    Original Title

    EURCS-505-EURIT-505-ok

    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 the details of a degree examination for a formal languages and automata theory course. It includes 10 questions across 5 units that cover topics like finite automata, regular expressions, context-free grammars, pushdown automata, Turing machines, and the Post correspondence problem. Students must answer all parts of 3 questions, selecting one question from each unit, within the allotted time of 3 hours.

    Copyright:

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

    B.Tech. Degree Examination Cse & It: (Nov-12) (EURCS-505/EURIT-505)

    Uploaded by

    VishalChakraraj
    This document contains the details of a degree examination for a formal languages and automata theory course. It includes 10 questions across 5 units that cover topics like finite automata, regular expressions, context-free grammars, pushdown automata, Turing machines, and the Post correspondence problem. Students must answer all parts of 3 questions, selecting one question from each unit, within the allotted time of 3 hours.

    Copyright:

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

    [Nov-12]

    [EURCS-505/EURIT-505]
    B.Tech. Degree Examination
    CSE & IT
    V SEMESTER
    FORMAL LANGUAGES & AUTOMATA THEORY
    (Effective from the admitted batch 2007–08)
    Time: 3 Hours Max.Marks: 60
    ----------------------------------------------------------------------------------------------------
    Instructions: Each Unit carries 12 marks.
    Answer all units choosing one question from each unit.
    All parts of the unit must be answered in one place only.
    Figures in the right hand margin indicate marks allotted.
    ---------------------------------------------------------------------------------------------------
    UNIT-I
    1. a) Construct DFA equivalent to NFA
    ({9 0 , 9 1 , 9 2 , 9 3 }, {0,1}, S, 9 0 , {9 1 , 9 3 })
    Where S is given in the following table? 8
    Σ 0 1
    Q
    90 91, 92 91
    91 92 9 1, 9 2
    92 93 90
    93 - 90

    b) Construct a Regular Expression for the language which accepts


    all strings with at least two C’s over the set 4
    Σ = {c, b}
    OR
    2. a) What are the applications of regular expression and Finite
    automata? 4
    b) Consider the language L of all strings of a’s and b’s that do
    not end with b and do not contain the substring bb. Find a
    finite language S so that L = S* 4
    c) Discuss in brief about Moore and Mealy Machine 4
    UNIT-II
    3. a) State and prove pumping lemma for regular languages 4
    b) Use pumping lemma to show that each of the following
    language is not regular: 8
    =i) L {xy / x, y ∈ {0,1}* and is either x (or) xn}
    =
    ii) L {ww / w ∈ {0,1}*}
    OR
    4. a) What are the closure properties of regular sets? Prove it 4
    b) Prove that, the following Language is non-regular using
    pumping Lemma 8
    =
    i) L {a b | n > 0}
    n n +1

    =
    ii) L { XY | x, y ∈{0,1}*
    and Y is either X or X r }

    UNIT-III
    5. a) The given context-free grammar G, find a CFG G ' in
    Chomsky normal form generating L(G)-{E} 6
    G has productions
    S → AaA | CA | aa | BaB
    A → aaBa | CDA | aa | DC
    B → bB | bAB | bb | aS
    C → Ca | bC | D
    D → bD | E
    b) Find a CFG generating the given language in the following
    cases:
    i) The set of even length string in {a,b}* with second symbol
    is a 6
    OR
    6. a) Prove that the given language is not a CFL using pumping
    lemma
    { X ∈{a, b}* | nb ( x) =
    L= na ( x)} 6
    b) Find the context-free grammar generating the language
    L= {a b c
    i j k
    | i= j + k } 6

    UNIT-IV
    7. a) Discuss about the relation between push down automata and
    CFG 4
    b) Give the transition table for PDAs recognizing the following
    language
    {
    i) a n X | n ≥ 0, x ∈ {a, b}* and | X |≤ n } 8
    OR
    8. a) If L is CFL, then we construct PDA A accepting L by stack
    i.e. L = N(A) 6
    b) Define pushdown automata with example 6
    UNIT-V
    9. Suppose L is accepted by a TM, T. Describe how could you
    construct a non-deterministic TM to accept each of the following
    languages:
    a) The set of all prefixes of element L
    b) The set of all suffixes of element L
    c) The set of all substrings of element L 12
    OR
    10. a) Define PCP. Prove that the PCP over Σ for (Σ)≥2 is insolvable 6
    b) Design Turing Machine to compute the function n! (Factorial
    of a number) 6

    [3,7/V S/112]

    You might also like