Scribd Logo
Upload

Welcome to Scribd!

  • Problem Set 2

    Uploaded by

    طاهر محمد
    6 views2 pages
    This document is a problem set from Cairo University's Computer Engineering department for their compilers and languages course in the spring 2022 semester. It contains 5 problems: 1) constructing DFAs for 3 regular languages involving counts of a's and b's, 2) constructing an NFA and DFA from a regular expression, 3) constructing a minimized DFA for binary strings read left-to-right without leading zeroes, 4) making a minimized DFA equivalent to a given NFA, and 5) minimizing two sample DFAs.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document is a problem set from Cairo University's Computer Engineering department for their compilers and languages course in the spring 2022 semester. It contains 5 problems: 1) constructing DFAs for 3 regular languages involving counts of a's and b's, 2) constructing an NFA and DFA from a regular expression, 3) constructing a minimized DFA for binary strings read left-to-right without leading zeroes, 4) making a minimized DFA equivalent to a given NFA, and 5) minimizing two sample DFAs.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    6 views2 pages

    Problem Set 2

    Uploaded by

    طاهر محمد
    This document is a problem set from Cairo University's Computer Engineering department for their compilers and languages course in the spring 2022 semester. It contains 5 problems: 1) constructing DFAs for 3 regular languages involving counts of a's and b's, 2) constructing an NFA and DFA from a regular expression, 3) constructing a minimized DFA for binary strings read left-to-right without leading zeroes, 4) making a minimized DFA equivalent to a given NFA, and 5) minimizing two sample DFAs.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    Cairo University Compilers and Languages Computer Eng. Dept.

    Faculty of Engineering Problem Set #2 Spring 2022

    1. Construct DFAs for each of the following regular languages. In all cases the alphabet is
    {a, b}.
    a) The set of strings that has exactly 3 bs (and any number of as).
    b) The set of strings where the number of bs is a multiple of 3 (and there can be any
    number of as).
    c) The set of strings where the difference between the number of as and the number of bs
    is a multiple of 3.

    2. Given the regular expression a*(a|b)aa:


    a) Construct an equivalent NFA for this regular expression.
    b) Convert this NFA to a DFA

    3. Given that binary number strings are read with the most significant bit first and may
    NOT have leading zeroes, construct the minimized DFA for the following language

    4. Make the minimized DFA equivalent to the following NFA:

    5. Minimize the following DFAs

    I II

    You might also like