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)
Sol: The Regular Expression (RE) corresponding to TG accepting EVEN-ODD language.
An FA that accepts the EVEN-ODD language of strings.
This FA is incorrect because it doesn't accept these strings (aabbbaabb).