Find a regular expression forL={w:na(w)and nb(w) are botheven }.
Using mnemonic label to denote even-odd paris of a and b foreach vertex in a transition graph. We get a dfa for the problem
How do I generate the regular expression from the DFA above?
EO Show transcribed image text
Expert Answer
An answer will be send to you shortly. . . . .