Go4Expert (http://www.go4expert.com/)
-   Assembly Language Programming (ALP) Forum (http://www.go4expert.com/forums/assembly-language-programming-forum/)
-   -   mystery question2 (http://www.go4expert.com/forums/mystery-question2-t19986/)

sajid227 4Nov2009 23:22

mystery question2
Consider the EVEN-ODD language of strings, defined over ∑= {a,b}, having even number of as 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)

All times are GMT +5.5. The time now is 12:21.