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

Welcome to Scribd!

  • 76 views

    Mca 2 Sem Theory of Automata Formal Languages Kca201 2023

    Uploaded by

    roushangupta919
    The document discusses concepts related to automata theory and formal languages. It contains questions about topics like regular expressions, pumping lemma, grammars, pushdown automata, Turing machines and more. Students are required to attempt questions from different sections covering these concepts.

    Copyright:

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

    Mca 2 Sem Theory of Automata Formal Languages Kca201 2023

    Uploaded by

    roushangupta919
    76 views3 pages
    The document discusses concepts related to automata theory and formal languages. It contains questions about topics like regular expressions, pumping lemma, grammars, pushdown automata, Turing machines and more. Students are required to attempt questions from different sections covering these concepts.

    Original Description:

    Ok

    Original Title

    mca-2-sem-theory-of-automata-formal-languages-kca201-2023

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses concepts related to automata theory and formal languages. It contains questions about topics like regular expressions, pumping lemma, grammars, pushdown automata, Turing machines and more. Students are required to attempt questions from different sections covering these concepts.

    Copyright:

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

    Mca 2 Sem Theory of Automata Formal Languages Kca201 2023

    Uploaded by

    roushangupta919
    The document discusses concepts related to automata theory and formal languages. It contains questions about topics like regular expressions, pumping lemma, grammars, pushdown automata, Turing machines and more. Students are required to attempt questions from different sections covering these concepts.

    Copyright:

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

    Printed Pages:03 Sub Code:KCA201

    Paper Id: 238045 Roll No.

    MCA
    (SEM II)) THEORY EXAMINATION 2022-23
    THEORY OF AUTOMATA & FORMAL LANGUAGES
    Time: 3 Hours Total Marks: 100
    Note: Attempt all Sections. If require any missing data; then choose suitably.

    SECTION A

    1. Attempt all questions in brief


    brief. 2 x 10 = 20
    (a) Differentiate between alphabets and strings.
    (b) What do you understand by dead state in transition diagram.
    (c) Design a regular expression that accepts all strings containing at exactlytwo a’s
    a
    over the input (a + b)*.
    (d) Elaborate the principal used in pumping lemma.
    (e) What is unit production?
    (f) What do you mean by ambiguous grammar?
    (g) Define“Instantaneous Description
    escription (ID)” of PDA.
    (h) What is need of special initial stack symbol in PDA?
    (i) 90
    Differentiate between Recursive and Recursively Enumerable Languages.
    anguages.

    2
    13
    (j) What do you mean by Halting Problem of Turing Machine?
    _2

    2.
    P2

    24
    SECTION B
    3E

    5.
    .5
    P2

    2. Attempt any three of the following:


    following 10x3=30
    17
    Q

    (a) Discuss transition function of NFA. Convert the given NFA into DFA. Also
    |1
    write tuples of corresponding DFA.
    5
    :0
    : 48
    08
    3
    02
    -2
    08
    1-
    |0

    (b) What do you mean by derivation of grammar


    grammar.. Productions of a grammar ‘G’ are
    defined as:
    S → 0B | 1A
    A → 0 | 0S | 1AA
    B →1 | 1S | 0BB.
    For the string 00110101, explore (a) the leftmost derivation, (b) the rightmost
    derivation. (c) the leftmost derivation tree, (d) the rightmost derivation tree.

    QP23EP2_290 | 01-08-2023 08:48:05 | 117.55.242.132


    (c) What do you mean by left linear and right linear grammar? Write down the
    grammar for given DFA.

    (d) Design a PDA that will accepts all even length palindromes over the input
    symbols {a,b}*. Also justify your transition diagram for the string
    w=“abbaaaabba”.
    (e) Define Post's Correspondence Problem (PCP) and Modified PCP with
    itsapplications. Find a PCP solutions
    so of the lists x=(b,bab3,ba) andy=(b3,ba,a).

    SECTION C
    3. Attempt any one part of the following:
    following 10x1=10
    90

    2
    (a) Define Deterministic Finite Automata (DFA). Mathematically represent a DFA

    13
    _2
    that will accept all strings of 0's and 1's except ‘101’ as a substring.

    2.
    (b) What do you understand by minimum state automation?
    automat ? Construct a minimum
    P2

    24
    state automation for the given transition diagram.
    3E

    5.
    .5
    P2

    17
    Q

    |1
    5
    :0
    : 48
    08
    3
    02

    4. Attempt any one part of the following:


    following 10x1=10
    (a) What do you mean by Regular Languages? Discuss the closure properties of
    -2

    Regular Languages.
    08

    (b) State Arden Theorem.. Find out the regular expression for the given transition
    1-

    diagram.
    |0

    QP23EP2_290 | 01-08-2023 08:48:05 | 117.55.242.132


    5. Attempt any one part of the following: 10x1=10
    (a) Discuss Chomsky Hierarchy in detail.
    (b) What do you mean by Chomsky Normal form (CNF)? After
    simplification convert the given productions ofCFG into CNF.
    S → ABA
    A → aA | ε
    B → aB | ε

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


    (a) What do you mean by Push Down Automata (PDA)? Discuss
    deterministic PDA with suitable example.
    (b) Using two stacks construct a PDA that will accept the Languages =
    { : ≥ 1}.

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


    (a) Define Turing Machine. Design a Turing Machine that will convert
    lower case characters to upper case characters for the inputs {a, b}*.
    (b) Write short note on following:
    (i) Variants of Turing Machines
    (ii) Church’s Thesis
    90

    2
    13
    _2

    2.
    P2

    24
    3E

    5.
    .5
    P2

    17
    Q

    |1
    5
    :0
    : 48
    08
    3
    02
    -2
    08
    1-
    |0

    QP23EP2_290 | 01-08-2023 08:48:05 | 117.55.242.132

    You might also like