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

Welcome to Scribd!

  • 104 views

    FLAT Practice Set - 1

    Uploaded by

    Bala Kumar
    This document provides a practice set of 12 multiple choice questions related to DFAs and NFAs. It includes questions about the definitions and properties of DFAs and NFAs, operations on languages, determining the language of given DFAs and NFAs, and identifying strings that are members of specific languages. The practice set has a deadline of October 8, 2016 for completion, with a discussion scheduled for August 11, 2016.

    Copyright:

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

    FLAT Practice Set - 1

    Uploaded by

    Bala Kumar
    104 views3 pages
    This document provides a practice set of 12 multiple choice questions related to DFAs and NFAs. It includes questions about the definitions and properties of DFAs and NFAs, operations on languages, determining the language of given DFAs and NFAs, and identifying strings that are members of specific languages. The practice set has a deadline of October 8, 2016 for completion, with a discussion scheduled for August 11, 2016.

    Original Description:

    Formal Languages and Automata Theory or Theory of Computation - Practice Questions

    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 provides a practice set of 12 multiple choice questions related to DFAs and NFAs. It includes questions about the definitions and properties of DFAs and NFAs, operations on languages, determining the language of given DFAs and NFAs, and identifying strings that are members of specific languages. The practice set has a deadline of October 8, 2016 for completion, with a discussion scheduled for August 11, 2016.

    Copyright:

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

    FLAT Practice Set - 1

    Uploaded by

    Bala Kumar
    This document provides a practice set of 12 multiple choice questions related to DFAs and NFAs. It includes questions about the definitions and properties of DFAs and NFAs, operations on languages, determining the language of given DFAs and NFAs, and identifying strings that are members of specific languages. The practice set has a deadline of October 8, 2016 for completion, with a discussion scheduled for August 11, 2016.

    Copyright:

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

    Tutorial Practice Set 1

    DFA and NFA


    Batch: B.Tech. CSE

    Deadline to solve: 10/08/2016


    (No Need to Submit)
    Discussion on: 11/08/2016 (Thursday)
    Note: Multiple options may be Correct.
    1. Let N be an NFA and w be a string. We say that N accepts w, if
    a) all computation paths of N on w reach an accept state.
    b) exactly one computation path of N on w reaches an accept state.
    c) no computation path of N on w reaches an accept state.
    d) atleast one computation path of N on w reaches an accept state.
    2. Let "."and "" be the concatenation and union operation as discussed in the lectures.
    Let A and B be two finite languages with cardinality (number of strings in the
    language) p and q respectively. Then what is the maximum number of stings in
    languages A.B and AB respectively.
    a) Pq and p+q.
    b) qp and p+q
    c) p*q and p+q
    d) p+q and p*q
    3. Consider the DFA A given below:

    If L1 = {Set of binary strings when interpreted as integer is divisible by 3}


    L2 = {Set of binary strings whose reversal when interpreted as integer is divisible by
    3}
    Which one of the following is correct?
    a)
    b)
    c)
    d)

    L1=L(A) but L2L(A)


    L1L(A) but L2=L(A)
    L1=L(A) and L2=L(A)
    L1L(A) and L2L(A)

    4. What is the minimum number of states in a DFA that recognizes the set of all binary
    strings which contains four consecutive 1s?
    a. 6
    b. 5
    c. 4
    d. 3
    5. Consider the following DFA

    Which one of the following is the language of the above DFA?


    a) Set of all binary strings which do not contain 101.
    b) Set of all binary strings which do not contain exaclty two 1s.
    c) Set of all binary strings which do not contain at least two 1s.
    d) Set of all binary strings which do not contain at least two 1s separated by at
    least one 0.
    6. Let Q be the number of states in an NFA N. From any state in N, on reading an input
    symbol, N can go to
    a) At most Q-1 states.
    b) At least Q-1 states.
    c) At most Q states.
    d) At least 2 states.
    7. Let L be a language and D be a DFA such that L=L(D). Which of the following
    statement is necessarily true?
    a. There exists only one DFA which accepts L.
    b. There exists only finitely many DFAs which accept L.
    c. There exists an NFA which accepts L.
    d. There exists infinitely many DFAs which accept L.
    8. Which of the following is true?
    a. Every NFA is also a DFA.
    b. Every DFA is also an NFA.
    c. There are some DFA which are not an NFA.
    d. None of the above.
    9. What is the language of the following NFA?

    a.
    b.
    c.
    d.

    Set of all strings which contains aa or bb as a substring.


    Set of all string which contains aa or bb as a substring but not both.
    Set of all string which contains aa as a substring.
    Set of all string which contains bb as a substring.

    10. Let A and B be two sets of binary strings. A string in A when interpreted as an integer
    is divisible by 2 and a string in B when interpreted as an integer is divisible by 3. Let
    "." be the concatenation operation. Which of the following is false?
    a. A string in A.B when interpreted as an integer is divisible by 6
    b. A string in B.A when interpreted as an integer is divisible by 6
    c. At least one of A.B and B.A is the set of strings which when interpreted as
    integer is divisible by 6
    d. There exists such A and B such that, strings in A.B and B.A when interpreted
    as an integer is divisible by 6
    11. What is the language of the following DFA?

    a. Set of all strings s, such that s contains substrings consist of all "b", saperated
    by a single "a"
    b. Set of all string which does not contain substring "aa".
    c. Set of all string which does not contain substring "aa" and ending with an "a".
    d. None of the above.
    12. Let ={0, 1} Which of the following words are in the language 2?
    a.
    b.
    c.
    d.

    00
    0011
    0101
    01

    You might also like