Consider the even-odd language of strings, defined over ? ={a, b}, having even number of a’s and odd number ofb, s.
a) build an fa for the givenlanguage
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 possiblesteps)

well cos like a ds it doesn't really die out, unlike for example, fifa, they always come out with a new version, so lets say your fifa 18 is charging you to update the teams and stuff, so, if messi were to go to real madrid (never gonna happen) it would switch messi to the other team, until the owners of fifa come out with fifa 19, then the game would eventually stop updating, and back to the ds, it doesn't really stop working after sometime because there's lots of things that it could be used for, and idk if u know what i'm saying, but long story short, samsung, represents the ds, if they still work, and people love them but not the new version, the old version still works, so they don't really force people to buy new phones, get me?