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 question2

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

  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)
     

Share This Page