mystery question4

Discussion in 'Assembly Language Programming (ALP) Forum' started by sajid227, Nov 5, 2009.

Thread Status:
Not open for further replies.
  1. sajid227

    sajid227 New Member

    Joined:
    Nov 4, 2009
    Messages:
    9
    Likes Received:
    0
    Trophy Points:
    0
    Consider the EVEN-ODD language of strings, defined over ∑= {a,b}, having even number of a’s and odd number of b,s.

    a) Build an FA for the given language
    b) Build a Transition Graph (TG) that accepts the same language but has fewer states than FA.
    c) Find the Regular Expression (RE) corresponding to TG accepting EVEN-ODD language (Show all possible steps)
     
    sajid227, Nov 5, 2009
    SHARE #1
  2. xpi0t0s

    xpi0t0s Mentor

    Joined:
    Aug 6, 2004
    Messages:
    3,009
    Likes Received:
    203
    Trophy Points:
    63
    Occupation:
    Senior Support Engineer
    Location:
    England
    This is an exact duplicate of your "mystery question 2" thread.
     
    xpi0t0s, Nov 6, 2009
    SHARE #2
  3. shabbir

    shabbir Administrator Staff Member

    Joined:
    Jul 12, 2004
    Messages:
    15,375
    Likes Received:
    388
    Trophy Points:
    83
    Please try avoiding creating same thread more than once. Thread closed. - mystery question2
     
    shabbir, Nov 7, 2009
    SHARE #3
Thread Status:
Not open for further replies.

Share This Page

  1. This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
    By continuing to use this site, you are consenting to our use of cookies.
    Accept Learn More...
    Dismiss Notice