Scribd Logo
Upload

Welcome to Scribd!

  • 17 views

    TOC Assignment1

    Uploaded by

    Sarah Pics
    1. The document provides three sets of questions about constructing DFAs to accept certain languages over the alphabet {0, 1}. Set A includes questions about languages containing at least three 1's and not ending in 11. Set B includes languages with an even number of 1's and a number of 1's divisible by 4. Set C includes languages of length two and beginning with 1 without two consecutive 0's. 2. For each set, the second question involves converting a given NFA to an equivalent DFA.

    Copyright:

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

    TOC Assignment1

    Uploaded by

    Sarah Pics
    17 views3 pages
    1. The document provides three sets of questions about constructing DFAs to accept certain languages over the alphabet {0, 1}. Set A includes questions about languages containing at least three 1's and not ending in 11. Set B includes languages with an even number of 1's and a number of 1's divisible by 4. Set C includes languages of length two and beginning with 1 without two consecutive 0's. 2. For each set, the second question involves converting a given NFA to an equivalent DFA.

    Original Description:

    toc

    Original Title

    TOC Assignment1 (1)

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    1. The document provides three sets of questions about constructing DFAs to accept certain languages over the alphabet {0, 1}. Set A includes questions about languages containing at least three 1's and not ending in 11. Set B includes languages with an even number of 1's and a number of 1's divisible by 4. Set C includes languages of length two and beginning with 1 without two consecutive 0's. 2. For each set, the second question involves converting a given NFA to an equivalent DFA.

    Copyright:

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

    TOC Assignment1

    Uploaded by

    Sarah Pics
    1. The document provides three sets of questions about constructing DFAs to accept certain languages over the alphabet {0, 1}. Set A includes questions about languages containing at least three 1's and not ending in 11. Set B includes languages with an even number of 1's and a number of 1's divisible by 4. Set C includes languages of length two and beginning with 1 without two consecutive 0's. 2. For each set, the second question involves converting a given NFA to an equivalent DFA.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 3

    Set –A

    S. no Question Mark CO BT
    s s Level
    1.         Construct  DFA to accept the following languages over alphabet {0, 1}   2.5 CO Level
    mark 4 5
      s

    a.       The language of all strings containing at least three 1’s.   Each

    b.      The language of all strings that do not end with 11.           

         
    2. Consider the following NDFA/NFA whose transition table is given and design DFA.     5 CO  Leve
    mark 5 l 6
    Q= {q0, q1, q2, q3}, ∑={a,b}. Here q0 is the initial state and q3 is the final state.    s
     

        

    Explain the procedure step by step.

     
    Assignment 1
    Set –B
    S. no Question Marks COs BT Level
    1. Construct  DFA to accept the following languages over alphabet {0, 1}         2.5 CO4 Level 5
    marks
    a.       The language of all strings containing even number of 1’s.     
    Each
    b.      The language of all strings containing number of 1’s divisible by 4.          
     
    2.  Consider the following automation and find the regular expression using Arden’s 5 marks CO5  Level 6
    theorem. 
     

    Explain the procedure step by step.

     
    Set –C
    S. no Question Marks COs BT Level
    1. 1.       Construct  DFA to accept the following languages over alphabet {0, 1}           2.5 CO4 Level 5
    marks
    a.       The language of all strings of length two.
    Each
    b.      The language of all strings beginning with 1 and not having two consecutive
    0’s.         
    2.           Consider the following NFA and construct equivalent DFA. 5 marks CO5  Level 6

    You might also like