1. We have moved from vBulletin to XenForo and you are viewing the site in the middle of the move. Though the functional aspect of everything is working fine, we are still working on other changes including the new design on Xenforo.
    Dismiss Notice

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

    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)
     
  2. xpi0t0s

    xpi0t0s Mentor

    This is an exact duplicate of your "mystery question 2" thread.
     
  3. shabbir

    shabbir Administrator Staff Member

    Please try avoiding creating same thread more than once. Thread closed. - mystery question2
     
Thread Status:
Not open for further replies.

Share This Page