Scribd Logo
Upload

Welcome to Scribd!

  • Part 1. 0 ( (110) U (101) U (00) U (011) U (0011) ) 00 Part 2. From Top To Bottom: 01 (0U1) 1 00 (1 U10)

    Uploaded by

    Kevin Gao
    6 views3 pages
    This document describes a non-deterministic finite automaton (NFA) and discusses why the language (0^n)(1^n) is not regular. It shows the NFA with states that accept strings with n 0s followed by n 1s. However, the NFA only accepts a single string for one value of n rather than the family of all strings for all values of n. Therefore, the language (0^n)(1^n) is not regular as it is not equivalent to the regular expression 0*1* which allows different numbers of 0s and 1s.

    Original Description:

    hw 11

    Original Title

    CS2800HW11

    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 describes a non-deterministic finite automaton (NFA) and discusses why the language (0^n)(1^n) is not regular. It shows the NFA with states that accept strings with n 0s followed by n 1s. However, the NFA only accepts a single string for one value of n rather than the family of all strings for all values of n. Therefore, the language (0^n)(1^n) is not regular as it is not equivalent to the regular expression 0*1* which allows different numbers of 0s and 1s.

    Copyright:

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

    Part 1. 0 ( (110) U (101) U (00) U (011) U (0011) ) 00 Part 2. From Top To Bottom: 01 (0U1) 1 00 (1 U10)

    Uploaded by

    Kevin Gao
    This document describes a non-deterministic finite automaton (NFA) and discusses why the language (0^n)(1^n) is not regular. It shows the NFA with states that accept strings with n 0s followed by n 1s. However, the NFA only accepts a single string for one value of n rather than the family of all strings for all values of n. Therefore, the language (0^n)(1^n) is not regular as it is not equivalent to the regular expression 0*1* which allows different numbers of 0s and 1s.

    Copyright:

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

    Part1.

    0((110)U(101)U(00)U(011)U(0011))*00

    Part2.
    Fromtoptobottom:
    01*
    (0U1)1*
    00(1*U10)

    Part3.

    Part4.

    Part5.
    A.Theflawisfoundinthefactthatthenumberof0sand1sdonothavetobethesame.A
    stringwithadifferentnumberof0sand1sdoesntsatisfy(0^n)(1^n).TheNFAdrawnimplies
    thatthepathcanloopon0adifferentnumberoftimesthanitdoesloopon1.

    B.Themachinecreatedwillonlyacceptonestring,dependingonwhatnumbernis.Wewantto
    showthatthelanguage(0^n)(1^n)canacceptallstringswithn0sfollowedbyn1s,thethe
    machineisonlycreatedtoacceptastringforonlyonenvalue.

    C.(0^n)(1^n)isnotthesameas0*1*,whereisaregularexpression.0*1*impliesthattherecan
    beadifferentnumberof0sand1s,whereasnisthesameforboth0and1inthefirst
    expression.(0^n)(1^n)isnotaregularexpression.

    You might also like