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

sajid227 5Nov2009 21:26

mystery question4
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)

xpi0t0s 7Nov2009 00:23

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

shabbir 7Nov2009 08:20

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

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