Scribd Logo
Upload

Welcome to Scribd!

  • L (W - W E (A, B) ,: Each A in W Is Immediately Preceded and Immediately Followed by A B

    Uploaded by

    Sikandar Niaz
    17 views4 pages
    Each a in w is immediately preceded and immediately followed by a b. W has neither aa nor bb as a substring. If the word begins with a 0, to be accepted it must end with a 1.

    Original Description:

    Original Title

    New Microsoft Office Word Document

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Each a in w is immediately preceded and immediately followed by a b. W has neither aa nor bb as a substring. If the word begins with a 0, to be accepted it must end with a 1.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    17 views4 pages

    L (W - W E (A, B) ,: Each A in W Is Immediately Preceded and Immediately Followed by A B

    Uploaded by

    Sikandar Niaz
    Each a in w is immediately preceded and immediately followed by a b. W has neither aa nor bb as a substring. If the word begins with a 0, to be accepted it must end with a 1.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 4

    1. L= {w|w E {a,b}*,: each a in w is immediately preceded and immediately followed by a b.

    2. L={w|w E {a,b}*: was has abab as substring.

    3. L= {w|w E {a,b}*; w has neither aa nor bb as a substring.

    4. L={w|w E {a,b}*, w has even number of substring ab

    5. L={w|w E {a,b}*: w has both ab and ba as substrings.

    6. L= {w|w E {a}*: th length of w is odd

    7. The set of all string ending in 00

    8. The set of all strings with three consecutive 0s ( Not necessarily at the end)

    9. The set of string with 011 as a substring

    10. The set of strings that have different first and last letters. If the word begins with a 0, to be accepted it must end with a 1 and vice versa.

    You might also like