mystery question4
 

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)

Re: mystery question4
 

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

Re: mystery question4
 

Please try avoiding creating same thread more than once. Thread closed. - mystery question2