mystery question2

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

  1. sajid227

    sajid227 New Member

    Nov 4, 2009
    Likes Received:
    Trophy Points:
    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

  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.
    Dismiss Notice